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: Runtime Error)

#include<bits/stdc++.h>
#define ll long long
using namespace std;
pair<int,int> a[200010] ;
vector<int> b;
int main() {
    int n;
    cin>>n;
    for(int i=0;i<n;i++){
        int k;
        cin>>k;
        a[i].second = k;
        b.push_back(k);
    }
    for(int i=0;i<n;i++){
        int k;
        cin>>k;
        a[i].first = k;
    }
    sort(a,a+n);
    /*
    for(int i=0;i<n;i++)
        cout<<a[i].first<<' ';
    cout<<"\n";
    for(int i=0;i<n;i++)
        cout<<a[i].second<<' ';
    cout<<'\n';*/
    sort(b.begin(),b.end());

    int cnt=0;
    for(int i=0;i<n;i++){
        int pos = upper_bound(b.begin(),b.end(),a[i].first)-b.begin();
       // cout<<pos<<'\n';
        if(a[i].first<a[i].second){
            if(b[pos-1]>a[i].first){
                cout<<"NO";
                return 0 ;
            }
            cnt++;
        }
        b.erase(b.begin()+pos-1);
        /*
        for(int i=0;i<b.size();i++)
            cout<<b[i]<<' ';
        cout<<'\n';*/
    }
    if(cnt>n-2)
        cout<<"No";
    else
        cout<<"Yes";
}