View Code of Problem 4068

# include<iostream>
# include<vector>
# include<math.h>
# include<algorithm>
using namespace std;
int main()
{
	int n;
	while(cin>>n && n){
		int ret = 0;
		vector<int> arr1(n), arr2(n);
		for(int i = 0; i < n; i++){
			cin>>arr1[i];
		}		
		sort(arr1.begin(), arr1.end(), greater<int>());
		for(int i = 0; i < n; i++){
			cin>>arr2[i];
		}
		sort(arr2.begin(), arr2.end(), greater<int>());
		int j = 0;
		for(int j = 0; j < n; j++){
			if(arr2[j]>=arr1[0])	continue;
			else break;
		}
		for(int i = 0; i < n; i++){
			ret += arr1[i] > arr2[(i + j + 1)%n]?1:arr1[i] < arr2[(i + j + 1)%n]?-1:0;
		}
		cout<<ret<<endl;
	} 
	return 0;
}