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 long mod = 998244353;

    static object process(TextReader input) {
        var n = int.Parse(input.ReadLine());
        var aa = ToIntArray(input.ReadLine(), n);
        var bb = ToIntArray(input.ReadLine(), n);

        var list1 = new List<work>(n);
        var list2 = new List<work>(n);
        
        for (int i=0; i<n; i++) {
            var w = new work();
            w.a = aa[i];
            w.b = bb[i];
            list1.Add(w);
            list2.Add(w);
        }

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

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

        list1.Sort((x1, x2)=>{
            long l = x1.a - x2.a;
            if (l > 0) return 1;
            if (l < 0) return -1;
            return 0;
        });
        list2.Sort((x1, x2)=>{
            long l = x1.b - x2.b;
            if (l > 0) return 1;
            if (l < 0) return -1;
            return 0;
        });

        int count = 0;
        for(int i=0; i<n; i++) {
            if(list1[i].a != list2[i].a || list1[i].b != list2[i].b) {
                count++;
            }
        }
        if(count > (n - 2)*2) {
            return "No";
        }

        return "Yes";
    }

    class work
    {
        public long a;
        public long b;
    }

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