|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||1024 MB||5||2||2||50.000%|
You have been put in charge of the 24th National Olympiad in Informatics!
This year, the competition consisted of N contestants and 2 rounds. The ith contestant scored Ai points in the first round and Bi points in the second round.
Furthermore, the rounds have associated positive integer weightages X and Y respectively. The ith contestant’s final score Si is given by Si = Ai × X + Bi × Y.
As the chairman, you have been given the freedom to select the values of X and Y as you wish.
Alas, Squeaky the Mouse has bribed you into committing fraud. To be exact, he has promised to reward you handsomely if you select some X and Y such that Si > Sj for all 1 ≤ i < j ≤ N.
But is it even possible to do so?
Your program must read from standard input.
The first line contains a single integer N, the number of contestants.
The second line contains N space-separated integers, A1, . . . , AN.
The third line contains N space-separated integers, B1, . . . , BN.
Your program must print to standard output.
YES if it is possible to commit fraud and
Bi = 0
N = 2
2 ≤ N ≤ 104
2 1 2 2 1
A possible solution is X = 1 and Y = 2.
This is since S1 = 1 × 1 + 2 × 2 = 5 > S2 = 2 × 1 + 1 × 2 = 4.
3 2 4 3 4 2 3
2 5 1 0 0