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 <string>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <limits>
#include <stack>
#include <queue>
#include <map>
#include <set>

using namespace std;

using ll = long long;
using ui = unsigned int;
const ll MOD = 1000000007;
const ll INF = 9223372036854775807;


//B
int main() {
	ll N;
	scanf("%lld", &N);
	vector<ll> a(N);
	for (ll i = 0; i < N; i++) {
		scanf("%lld", &a[i]);
	}
	vector<ll> b(N);
	for (ll i = 0; i < N; i++) {
		scanf("%lld", &b[i]);
	}

	ll need = 0;
	for (ll i = 0; i < N; i++) {
		if (a[i] > b[i]) {
			need++;
		}
	}

	std::sort(a.begin(), a.end());
	std::sort(b.begin(), b.end());

	bool result = true;

	for (ll i = 0; i < N; i++) {
		if (a[i] > b[i]) {
			result = false;
			break;
		}
	}

	if (result) {
		if (need > N - 2) {
			result = false;
		}
	}

	if (result) {
		printf("Yes\n");
	}
	else {
		printf("No\n");
	}
}

//A
/*
int main() {
	ll N;
	scanf("%lld", &N);

	ll result = 0;

	for (ll i = 1; i <= N / 2; i++) {
		if (N - i != i) {
			result++;
		}
	}

	printf("%lld\n", result);
}
*/