田忌赛马（C++）

贪心题

#include <bits/stdc++.h>
using namespace std;
int main() {
	int n;
	int tian[2002], qi[2002];
	cin >> n;
	for (int i = 1; i <= n; i++)
		cin >> tian[i];
	for (int i = 1; i <= n; i++)
		cin >> qi[i];
	sort(tian + 1, tian + 1 + n);
	sort(qi + 1, qi + 1 + n);
	int tm, qm, tk, qk;
	tm = 1, qm = 1;
	tk = n, qk = n;
	int money = 0;
	for (int i = 1; i <= n; i++) {
		if (tian[tk] > qi[qk]) { 
			money += 200;
			tk--, qk--;
		} else if (tian[tk] < qi[qk]) { 
			money -= 200;
			tm++, qk--;
		} else {
			if (tian[tm] > qi[qm]) { 
				money += 200;
				tm++, qm++;
			} else {
				if (tian[tm] < qi[qk]) {
					money -= 200;
					tm++, qk--;
				}
			}
		}
	}
	cout << money;
	return 0;
}