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 Rust (1.15.1) (judge verdict: Wrong Answer)

#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };

    ($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        #[cfg(debug_assertions)]
        writeln!(&mut std::io::stderr(), concat!("[DEBUG] ", $(stringify!($a), "={:?} "),*), $($a),*);
    }
}

#[allow(unused_imports)]
use std::cmp::{min, max};
#[allow(unused_imports)]
use std::io::{stdout, stdin, BufWriter, Write};

fn main() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {
        ($($format:tt)*) => (write!(out,$($format)*).unwrap());
    }

    input!{
      n: usize,
      aa: [usize; n],
      bb: [usize; n],
    }

    let mut aa2 = aa.clone();
    aa2.sort();
    let mut bb2 = bb.clone();
    bb2.sort();

    for i in 0..n {
        if aa2[i] > bb2[i] {
            return puts!("{}\n", "No");
        }
    }

    for i in 0..n {
        // 1 2 3 3
        // 1 2 3 4
        if i > 0 {
            if aa2[i] <= bb2[i-1] {
                return puts!("{}\n", "Yes");
            }
        }
    }


    // 愚直にシミュレーション
    let mut bb: Vec<_> = bb.into_iter().enumerate().map(|(i, v)| (v, i)).collect();

    let mut aa2 = vec![];
    for &(_, idx) in bb.iter() {
        aa2.push( aa[idx] );
    }

    let mut aa = aa2;
    let mut a_pos: Vec<_> = aa.iter().cloned().enumerate().map(|(i, v)| (v, i)).collect();
    a_pos.sort();
    let mut a_pos: Vec<_> = a_pos.iter().map(|v|v.1).collect();

    let mut sorted_a: Vec<_> = aa.clone();
    sorted_a.sort();

    for i in 0..n-1 {
        let b = bb[i].0;

        // swap i and pos;
        let pos = a_pos[i];

        debug!(aa, a_pos, i, pos);
        if i == pos {
            return puts!("{}\n", "Yes");
        }

        let a = aa[i];
        let sorted_index = sorted_a.binary_search(&a).unwrap();

        let temp = aa[i];
        aa[i] = aa[pos];
        aa[pos] = temp;

        a_pos[i] = i;
        a_pos[sorted_index] = pos;
    }

    puts!("{}\n", "No");
}