赛马 贪心算法 oj1149

#include <iostream>
#include <list>
const int MAX = 1000;
using namespace std;

int main() {
	int N = 1;
	list<int> yuan;
	list<int> king;
	list<int> result;
	int i, n, winTime;
	
	while (true) {
		cin >> N;
		if (N == 0) break;
		i = N;
		n = 0;
		while (i--) {
			cin >> n;
			yuan.push_front(n);
		}
		i = N;
		while (i--) {
			cin >> n;
			king.push_front(n);
		}
		yuan.sort();
		king.sort();
		winTime = 0;
		i = N;
		while (i--) {
			if (yuan.back() > king.back()) {
				yuan.pop_back();
				king.pop_back();
				winTime++;
			}
			else {
				yuan.pop_front();
				king.pop_back();
				winTime--;
			}
		}
		
		winTime > 0 ? result.push_back(1) : result.push_back(0);
	}
	list<int>::iterator it;
	
	for (it = result.begin(); it != result.end(); ++it) {
		*it == 0 ? cout << "NO" << endl : cout << "YES" << endl;
	}
	return 0;
}