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 C (GCC 5.4.1) (judge verdict: Wrong Answer)

int max(int a[], int N){
        int i;
        int max = a[0];
        for(i=0;i<N;i++){
            if(a[i] > max){
                max = a[i];
            }
        }
  return max;
    }

void bsort(int a[], int N){//小さい順に並び替える
        int i,j;
        for(i=0;i<N-1;i++){
            for(j= N-1;j>i;j--){
                if(a[j -1] > a[j]){
                    int tmp = a[j];
                    a[j] = a[j-1];
                    a[j-1] = tmp;
                }
            }
        }
    }


#include<stdio.h>
int main()
{
	int N;
  scanf("%d", &N);
  	
  
  	int i;
  	int A[N],B[N];
 	int a[N],b[N];
  
  	for(i=0;i<N;i++){
	scanf("%d",&A[i]);
      a[i] = A[i];
    }
  	for(i=0;i<N;i++){
      scanf("%d",&B[i]);
       b[i] = B[i];
    }
	int ma,mb;
  	ma = max(A,N);
  	mb = max(B,N);
  	bsort(a,N);
  	bsort(b,N);
  
  
  
  	if(mb < ma){
		printf("No");
      return 0;
    }
		
  	for(i=0;i<N;i++){
		if(b[i]<a[i]){
			printf("No");
        }
    }
  printf("Yes");
  
  
    return 0;   
}