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 C (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>
int 
main(){
	long a[100100],b[100100];
	long int n;
	long int j,i,max_a=0,max_b=0;
	long int cnt = 0;
	
	scanf("%ld",&n);
	
	for(i=0;i<n;i++)
		scanf("%ld",&a[i]);
	for(i=0;i<n;i++)
		scanf("%ld",&b[i]);
		
	
	for(i=0;i<n;i++){
		if(max_a<a[i])max_a=a[i];
		if(max_b<b[i])max_b=b[i];
		if(a[i]<=b[i]);
		else cnt++;
	}
	
	if(max_a>max_b){
		printf("No\n");
		return 0;	
	}
	if(cnt<=n-2){
		printf("Yes\n");
		//printf("%ld ,%ld, Yes\n",cnt, n-2);
		return 0;
	}
	
	printf("%No\n");
		
	
 return 0;
}