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<iomanip>
#include<string>
#include<set>
#include<map>
#include<vector>
#include<utility>
#include<queue>
#include<algorithm>
#include<functional>

using namespace std;
#define LL unsigned long long
#define MOD 998244353
#define inf 1999999999

int n,a[100002],b[100002],swpcnt=0;
vector<pair<int,int>>vp;
int main() {
	cin >> n;
	for (int i = 0; i<n; i++)cin >> a[i];
	for (int i = 0; i<n; i++)cin >> b[i];
	for (int i = 0; i<n; i++)vp.push_back({b[i],a[i]});
	sort(vp.begin(),vp.end());
    for(int i=0; i<n; i++)vp[i].second*=-1;
	for(int i=0; i<n; i++){
		if(vp[i].first<vp[i].second*-1){
			pair<int,int>find={vp[i].second*-1,vp[i].first*-1};
			auto itr = lower_bound((vp.begin()+i+1),vp.end(),find);
			if(itr==vp.end()||swpcnt>=n+2){
				cout << "No" << endl;
				return 0;
			}
			find = *itr;
			swap(vp[i].second, find.second);
			swpcnt++;
		}
	}
	cout << "Yes" << endl;
	return 0;
}