Problem:
Score : 600 points

Problem Statement

Given are two integer sequences of N elements each: A_1,...,A_N and B_1,...,B_N.
Determine if it is possible to do the following operation at most N-2 times (possibly zero) so that, for every integer i from 1 to N, A_i \leq B_i holds:

Choose two distinct integers x and y between 1 and N (inclusive), and swap the values of A_x and A_y.

Constraints

2 \leq N \leq 10^5

1 \leq A_i,B_i \leq 10^9

Input

Input is given from Standard Input in the following format:

N
A_1 A_2 ... A_N
B_1 B_2 ... B_N

Output

If the objective is achievable, print Yes; if it is not, print No.

Sample Input 1

3
1 3 2
1 2 3

Sample Output 1

Yes

We should swap the values of A_2 and A_3.

Sample Input 2

3
1 2 3
2 2 2

Sample Output 2

No

Sample Input 3

6
3 1 2 6 3 4
2 2 8 3 4 3

Sample Output 3

Yes

Solution in Java7 (OpenJDK 1.7.0) (judge verdict: Runtime Error)

package mainv2;

import java.util.ArrayList;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		ArrayList<Integer> Ai = new ArrayList<Integer>();
		ArrayList<Integer> Bi = new ArrayList<Integer>();
		Scanner sc = new Scanner(System.in);
		
		int N = sc.nextInt();
		int i = 0;
		while(N!=i) {
			i++;
			Ai.add(sc.nextInt());
		}
		i=0;
		while(N!=i) {
			i++;
			Bi.add(sc.nextInt());
		}
		i = 0;
		int tmp1,tmp2,nb;
		while(N-1!=i) {
			i++;
			nb=1;
			while(nb!=N) {
			if(Ai.get(nb-1)>Ai.get(nb)) {
				tmp1 = Ai.get(nb-1);
				tmp2 =Ai.get(nb);
				Ai.set(nb, tmp1);
				Ai.set(nb-1, tmp2);
			}nb++;
			}
			
		}
		i=0;
		while(N-1!=i) {
			i++;
			nb=1;
			while(nb!=N) {
			if(Bi.get(nb-1)>Bi.get(nb)) {
				tmp1 = Bi.get(nb-1);
				tmp2 =Bi.get(nb);
				Bi.set(nb, tmp1);
				Bi.set(nb-1, tmp2);
			}nb++;
			}
			
		}
		i=0;
		while(N!=i) {
			if(Ai.get(i)>Bi.get(i)) {
				System.out.println("yes");
              break;
			}
			i++;
		}
      System.out.println("no");
	}
}