UVALive - 3266 Tian Ji -- The Horse Racing

题目传送门

#include <iostream>
#include <stdio.h>
#include <string>
#include <string.h>
#include <algorithm>
#include <queue>
#include <vector>
#include <string.h>
#define MAXN 1010
#define INF 0x3f3f3f
using namespace std;
int a[MAXN];
int b[MAXN];
int main(void)
{
	int N;

	while (scanf("%d", &N) != EOF && N)
	{
		for (int i = 0; i < N; i++)scanf("%d", &a[i]);
		for (int i = 0; i < N; i++)scanf("%d", &b[i]);
		sort(a, a + N);
		sort(b, b + N);
		int coun = 0;
		int eq = 0;
		for (int i = 0; i < N; i++)
		{
			for (int j = N-1; j >= 0; j--)
				if (a[i] > b[j])
				{
					b[j] = INF;
					a[i] = INF;
					coun++;
					break;
				}

		}
		for (int i = 0; i < N; i++)
		{
			if (a[i] != INF)
			{
				for (int j = 0; j < N; j++)
					if (a[i] == b[j])
					{
						eq++;
						a[i] = INF;
						b[j] = INF;
						break;
					}
			}
		}
		printf("%d\n", (coun - (N - coun - eq)) * 200);
	}

	return 0;
}