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 Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.Scanner;

class Main {
  public static void main(String[] args) {
    Scanner stdIn = new Scanner(System.in);
    int count = 0;
    boolean flag1 = false;
    boolean flag2 = false;

    int n = stdIn.nextInt();
    int[] a = new int[n];
    int[] b = new int[n];

    for (int i = 0; i < n; i++) {
      a[i] = stdIn.nextInt();
    }
    for (int i = 0; i < n; i++) {
      b[i] = stdIn.nextInt();
    }

    for (int i = 0; i < n; i++) {
      if (a[i] > b[i]) {
        for (int j = i + 1; j < n; j++) {
          if (a[j] <= a[i] - 1) {
            int c = a[j];
            a[j] = a[i];
            a[i] = c;
            count++;
            flag1 = true;
            break;
          }
        }
        if (!flag1) {
          for (int k = 0; k < n; k++) {
            if (a[i] < b[k]) {
              int c = a[i];
              a[i] = a[k];
              a[k] = c;
            }
            if (a[i] <= b[i] && a[k] <= b[k]) {
              count++;
              flag2 = true;
              break;
            } else {
              int c = a[i];
              a[i] = a[k];
              a[k] = c;
            }
          }
          if (!flag2) {
            System.out.println("No");
            break;
          }
        }
      }
    }

    if (count <= n - 2) {
      System.out.println("Yes");
    } else {
      System.out.println("No");
    }

  }
}