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# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.Diagnostics;
using System.IO;
using System.Text;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static void Main(string[] args) {
#if DEBUG
        //MyDebugger.MakeTestCase("../TextFile2.txt"); return;
        MyDebugger.Test(process, "../TextFile1.txt");
#else
        object ret = process(new StreamReader(Console.OpenStandardInput()));
        Console.WriteLine(ret);
#endif
    }
    
    static object process(TextReader input) {
        var n = int.Parse(input.ReadLine());
        var aa = ToIntArray(input.ReadLine(), n);
        var bb = ToIntArray(input.ReadLine(), n);

        var aaa = new List<work>(n);

        for (int i=0; i<n; i++) {
            aaa.Add(new work() { a = aa[i], b = bb[i] });
        }

        aa.Sort();
        bb.Sort();

        for(int i=0; i<n; i++) {
            if (aa[i] > bb[i]) return "No";
        }

        aaa.Sort((x,y)=> { return x.b - y.b; });
        for (int i = 0; i < n; i++) aaa[i].idx = i;
        aaa.Sort((x, y) => { return x.a - y.a; });

        int count = 0;
        int idx = 0;
        while (true) {
            count++;
            var w = aaa[idx];
            if (w.idx == 0) break;
            idx = w.idx;
        }
        if (count < n) return "Yes";

        //for(int i=0; i<n-1; i++) {
        //    if (aa[i + 1] <= bb[i]) return "Yes";
        //}
        return "No";
    }

    class work
    {
        public int idx;
        public int a;
        public int b;
    }

    static List<int> ToIntArray(string strs, int n) {
        var ret = new List<int>(n);
        var spl =strs.Split(' ');
        for (int i = 0; i < n; i++)
            ret.Add(int.Parse(spl[i]));
        return ret;
    }
}