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 Go (1.6) (judge verdict: Wrong Answer)

package main

import (
        "bufio"
        "fmt"
        "os"
        "strconv"
        "strings"
)

func main() {
        sc := bufio.NewScanner(os.Stdin)

        var n int
        if sc.Scan() {
                n, _ = strconv.Atoi(sc.Text())
        }

        as := make([]int, n)
        if sc.Scan() {
                ss := strings.Split(sc.Text(), " ")
                for i := range ss {
                        as[i], _ = strconv.Atoi(ss[i])
                }
        }

        bs := make([]int, n)
        if sc.Scan() {
                ss := strings.Split(sc.Text(), " ")
                for i := range ss {
                        bs[i], _ = strconv.Atoi(ss[i])
                }
        }

        for i := 0; i < n; i++ {

        }

        scores := make([]score, n)
        for i := 0; i < n; i++ {
                scores[i].a = as[i]
                scores[i].b = bs[i]
                scores[i].s = bs[i] - as[i]
        }

        var ok bool
        for i, s := range scores {
                if s.s < 0 {
                        ok = searchAndSwitch(scores, i)
                        if !ok {
                                break
                        }
                }
        }

        if ok {
                fmt.Println("Yes")
        } else {
                fmt.Println("No")

        }
        //sort.Slice(scores, func(i, j int) bool {
        //      return scores[i].s < scores[j].s
        //})
        //fmt.Println(scores)
}

// target must be minus target
// 返り値は入れ替えられたかどうか
func searchAndSwitch(scores []score, target int) bool {
        t := scores[target]
        minB := t.a
        myB := t.b
        for i := range scores {
                // プラスになる B を見つける
                if scores[i].b >= minB {
                        // 自分の B と入れ替えてもマイナスにならないなら入れ替え
                        if myB-scores[i].a >= 0 {
                                scores[target].b = scores[i].b
                                scores[i].b = myB

                                scores[target].s = scores[target].b - scores[target].a
                                scores[i].s = scores[i].b - scores[i].a

                                return true
                        }
                }
        }

        return false
}

type score struct {
        a int
        b int
        s int // score
}