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)

#include<stdio.h>
#include<math.h>

int main(){
  
  int A[1000000];
  int B[1000000];
  int N;
  int dainyu1,dainyu2;
  int count1=0,count2=0,count3=0;
  
  scanf("%d",&N);
  
  while(A[count1]!='\0'){
    scanf("%d ",&A[count1]);
  }
  count1=0;
  printf("\n");
  while(B[count1]!='\0'){
    scanf("%d ",&B[count1]);
    }
  
  for(count1=0;count1<=N;count1++){
    
    if(A[count1]<=B[count1]){
      
      while(A[count1]>A[count1+count2]){
        count2++;
        }
      
      dainyu1=A[count1];
      dainyu2=A[count1+count2];
      A[count1]=dainyu2;
      A[count1+count2]=dainyu1;
      count2=0;
     }
    count3++;
      }
  
  if(count3<(N-2)){
    printf("Yes");
    }else{
    printf("No");
    }
  
  return 0;
  }