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: Runtime Error)

#include <stdio.h>
#include <math.h>
#define SS 10000

int main(void){
  int N,a[SS],b[SS];
  int i,j,num1,num2;
  scanf("%d\n",&N);
  for(i=0;i<=N-1;i++){
    scanf("%d ",&a[i]);
  }
  for(i=0;i<=N-1;i++){
    scanf("%d ",&b[i]);
  }
  //------ sort ------
  for(i=0;i<=N-2;i++){
    for(j=1;i<=N-1;j++){
      if(a[i]>a[j]){
        num1=a[i];
        a[i]=a[j];
        a[j]=num1;
      }
      if(b[i]>b[j]){
        num2=b[i];
        b[i]=b[j];
        b[j]=num2;
      }
    }
  }
  
  for(i=0;i<=N-1;i++){
    if(a[i]<=b[i]){printf("Yes");}
    else if(a[i]>b[i]){printf("No");}
  }
  return 0;
}