View Code of Problem 4068

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
bool cmp(int a,int b)
{
	return a >b;
}
int main()
{
	int n;
	while(cin >> n)
	{
		if(n == 0) break;
		int a[n], b[n];
		for(int i = 0;i < n;i ++) cin >> a[i];
		for(int i = 0;i < n;i ++) cin >> b[i];
		sort(a,a+n,cmp);
		sort(b,b+n,cmp);
		int win = 0, lose = 0;
		for(int i = 0;i < n - 1;i ++)
		{
			if(a[i] > b[i+1]) win ++;
			else if(a[i] < b[i + 1]) lose ++;
		}
		if(a[n-1] > b[0]) win++;
		else if(a[n-1] < b[0])lose ++;
		cout << win-lose << endl;
	}
	return 0;
}