3535490_ac_32ms_264k.cpp

北大大牛代码 1240道题的原代码 超级权威

#include <stdio.h>
#include <algorithm>

using namespace std;

char name[21][100];
int n;
int voter[1000][21];
int v;
int eff[21];
int cnt[21];

int main()
{
	int i, j;

	scanf("%d", &n);
	getchar();
	for (i = 0; i < n; i++)
	{
		gets(name[i]);
		eff[i] = 1;
	}
	v = 0;
	while (scanf("%d", &voter[v][0]) == 1)
	{
		for (i = 1; i < n; i++)
		{
			scanf("%d", &voter[v][i]);
		}
		v++;
	}
	int count = 0;
	while (true)
	{
		memset(cnt, 0, sizeof(cnt));
		for (i = 0; i < v; i++)
		{
			for (j = 0; j < n; j++)
			{
				if (eff[voter[i][j] - 1] == 1)
				{
					cnt[voter[i][j]]++;
					break;
				}
			}
		}
		int id = 0;
		int max = 0;
		int min = 1000;
		for (i = 1; i <= n; i++)
		{
			if (eff[i - 1] == 1 && cnt[i] > max)
			{
				max = cnt[i];
				id = i;
			}
			if (eff[i - 1] == 1 && cnt[i] < min)
			{
				min = cnt[i];
			}
		}
		if (min == max)
		{
			for (i = 0; i < n; i++)
			{
				if (eff[i])
				{
					puts(name[i]);
				}
			}
			break;
		}
		if (max > v / 2)
		{
			puts(name[id - 1]);
			break;
		}
		for (i = 1; i <= n; i++)
		{
			if (eff[i - 1] == 1 && cnt[i] == min)
			{
				eff[i - 1] = 0;
			}
		}
	}
	return 0;
}