22259번 - Fraud 서브태스크다국어

문제

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 i^th contestant scored A_i points in the first round and B_i points in the second round.

Furthermore, the rounds have associated positive integer weightages X and Y respectively. The i^th contestant’s final score Si is given by S_i = A_i × X + B_i × 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 S_i > S_j 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, A₁, . . . , A_N.

The third line contains N space-separated integers, B₁, . . . , B_N.

출력

Your program must print to standard output.

Output YES if it is possible to commit fraud and NO otherwise.

제한

• 2 ≤ N ≤ 3 × 10⁵
• 0 ≤ A_i, B_i ≤ 10⁶

서브태스크

힌트