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 Kotlin (1.0.0) (judge verdict: Wrong Answer)

fun main(args: Array<String>){
    var isJudge = false
    val n = readLine()!!.toInt()
    var a = readLine()!!.split(" ").map(String::toInt).toMutableList()
    var b = readLine()!!.split(" ").map(String::toInt).toMutableList()
    var oCnt = 0
    while(oCnt<=n-2){
        var nCnt = 0
        var none = 0
        for(i in 0 until n){
            if (a[i]<=b[i]){
                nCnt++
            } else {
                for (j in 0 until n) {
                    if (a[i]<=b[j]) {
                        var temp = b[i]
                        b[i] = b[j]
                        b[j] = temp
                        nCnt++
                        oCnt++
                        break
                    } else {
                        none++
                    }
                }
            }
        }
        if (nCnt==n){
            isJudge = true
            break
        }
        if (none==n){
            break
        }
    }
    if (isJudge){
        println("Yes")
    } else {
        println("No")
    }
}