{"problem":{"name":"Swaps","description":{"content":"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 ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"nikkei2019_2_qual_c"},"statements":[{"statement_type":"Markdown","content":"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:\n\n*   Choose two distinct integers $x$ and $y$ between $1$ and $N$ (inclusive), and swap the values of $A_x$ and $A_y$.\n\n## Constraints\n\n*   $2 \\leq N \\leq 10^5$\n*   $1 \\leq A_i,B_i \\leq 10^9$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$A_1$ $A_2$ $...$ $A_N$\n$B_1$ $B_2$ $...$ $B_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"nikkei2019_2_qual_c","tags":[],"sample_group":[["3\n1 3 2\n1 2 3","Yes\n\nWe should swap the values of $A_2$ and $A_3$."],["3\n1 2 3\n2 2 2","No"],["6\n3 1 2 6 3 4\n2 2 8 3 4 3","Yes"]],"created_at":"2026-03-03 11:01:13"}}