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

#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main(){
   int n;
   cin>>n;
   long long int a[n],b[n];
   for(int i=0;i<n;i++){
      cin>>a[i];
   }
   for(int i=0;i<n;i++){
      cin>>b[i];
   }
   int count=0;
   for(int i=0;i<n;i++){
      if(a[i]>b[i]){
	 count++;
      }
   }
   if(count>n-2){
      cout<<"No"<<endl;
      exit(0);
   }
   int maxa=a[0];
   for(int i=1;i<n;i++){
      if(a[i]>maxa){
	 maxa=a[i];
      }
   }
   int maxb=b[0];
   for(int i=1;i<n;i++){
      if(b[i]>maxb){
	 maxb=b[i];
      }
   }
   if(maxa>maxb){
      cout<<"No"<<endl;
   }
   else if(count<=n-2 && maxa<=maxb){
      cout<<"Yes"<<endl;
   }
}