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.Linq;
using System.Collections.Generic;
using System.Numerics;
class ProgramC
    {
        static void Main(string[] args)
        {
            string input = Console.ReadLine();
            long n = long.Parse(input);

            long[] b = new long[n];
            List<Task> task= new List<Task>();
            
            string[] input_a = Console.ReadLine().Split();
            string[] input_b = Console.ReadLine().Split();


            for(long i = 0;i < n;i++)
            {
                long a = long.Parse(input_a[i]);
                b[i] = long.Parse(input_b[i]); 
                task.Add(new Task(a,i));
            }

            Array.Sort(b);
            IOrderedEnumerable<Task> sorted = task.OrderBy(x => x.a);

            
            long j = 0;
            foreach(Task s in sorted)
            {
                if(s.a > b[j])
                {
                    Console.WriteLine("No");
                    return;
                } 
                j++;
            }

            long count = 0;
            foreach(Task s in sorted)
            {
               if(s.order == count)
                     break;
               count++;
            }

            if(count != n)
            {
                Console.WriteLine("Yes");
                return;
            }
            

            j = 1;
            foreach(Task s in sorted)
            {
                if(s.a <= b[j - 1])
                {
                    Console.WriteLine("Yes");
                    return;
                } 
                j++;
            }

            Console.WriteLine("No");
        }
    }

    public class Task
    {
        public long order;
        public long a;
        public Task(long a, long order)
        {
            this.a = a;
            this.order = order;
        }
    }