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<stdlib.h>
#include<string.h>


int str_cmp(const void *a,const void *b){
  return strcmp((char *)a,(char *)b);
}

int cmp(const int *a,const int *b){
  if(*a>*b){
    return 1;
  }
  else if(*a<*b)
  return -1;
  else return 0;
}




 int  main(void){
   int n;
   int i,j;
   scanf("%d",&n);

   long long a[n],b[n];
   for(i=0;i<n;i++){
     scanf("%ld",&a[i]);
   }
   for(i=0;i<n;i++){
     scanf("%ld",&b[i]);
   }
   qsort(a,n,sizeof(long long ),(int (*)(const void *,const void *))cmp);
   qsort(b,n,sizeof(long long ),(int (*)(const void *,const void *))cmp);
   for(i=0;i<n;i++){
     if(a[i]>b[i]){
       printf("No");
       return 0;
     }
   }
   printf("Yes");
  return 0;
}