ZOJ-1277

模拟，感觉题目描述不够清楚，规则都不知道怎么搞的，这题乱写的。。推荐别做了

#include<cstdio>
#include<vector>
#include<deque>
#include<algorithm>
#include<cstring>
#include<set>

using namespace std;

namespace
{
	bool cmp(const pair<int, int> &p1, const pair<int, int> &p2)
	{
		return p1.second != p2.second ?
				p1.second > p2.second : p1.first < p2.first;
	}
}

int main()
{
	int c, n;
	vector<deque<int> > V;
	set<int> S;
	int count[6], cs = 0;
	vector<pair<int, int> > P;
	while (scanf("%d %d", &c, &n), c || n)
	{
		printf("Election #%d\n", ++cs);
		V.clear();
		int bad = 0;
		for (int i = 0; i < n; i++)
		{
			deque<int> q;
			int num;
			bool valid = true;
			for (int j = 0; j < c; j++)
			{
				scanf("%d", &num);
				if (num < 1 || num > c
						|| find(q.begin(), q.end(), num) != q.end())
					valid = false;
				q.push_back(num);
			}
			if (valid)
				V.push_back(q);
			else
				bad++;
		}
		printf("   %d bad ballot(s)\n", bad);

		S.clear();
		int total = n - bad;
		while (true)
		{
			memset(count, 0, sizeof(count));
			P.clear();
			for (size_t i = 0; i < V.size(); i++)
				count[V[i].front()]++;
			for (int i = 1; i <= c; i++)
				if (count[i])
					P.push_back(make_pair(i, count[i]));
			sort(P.begin(), P.end(), cmp);
			if (P.front().second > total / 2)
			{
				printf("   Candidate %d is elected.\n", P.front().first);
				break;
			}
			int min = P.back().first;
			S.insert(min);
			for (size_t i = 0; i < V.size(); i++)
				while (!V[i].empty() && S.find(V[i].front()) != S.end())
					V[i].pop_front();

			for (size_t i = 0; i < V.size(); i++)
				count[V[i].front()]++;
			for (int i = 1; i <= c; i++)
				if (count[i])
					P.push_back(make_pair(i, count[i]));
			sort(P.begin(), P.end(), cmp);

			vector<int> T;
			int max = P.front().second;
			for (size_t i = 0; i < P.size(); i++)
				if (P[i].second == max)
					T.push_back(P[i].first);
			if (T.size() > 1)
			{
				printf("   The following candidates are tied:");
				for (size_t i = 0; i < T.size(); i++)
					printf(" %d", T[i]);
				puts("");
				break;
			}

		}
	}
	return 0;
}