4107966_wa.cpp

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

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

using namespace std;
int g, n;
int m[20];
int cnt[6];
vector <int> p[20];

int main()
{
	int i, j;

	while (scanf("%d%d", &g, &n) == 2)
	{
		if (!g && !n)
			break;
		for (i = 0; i < g; i++)
		{
			scanf("%d", &m[i]);
			p[i].clear();
			for (j = 0; j < n; j++)
			{
				int t;
				scanf("%d", &t);
				p[i].push_back(t);
			}
		}
		for (i = 1; i < n; i++)
		{
			memset(cnt, 0, sizeof(cnt));
			for (j = 0; j < g; j++)
			{
				cnt[p[j][0]] += m[j];
			}
			int t = 1;
			for (j = 2; j <= n; j++)
			{
				if (cnt[j] >= cnt[t])
				{
					t = j;
				}
			}
			for (j = 0; j < g; j++)
			{
				for (vector <int>::iterator it = p[j].begin(); it != p[j].end(); ++it)
				{
					if ((*it) == t)
					{
						p[j].erase(it);
						break;
					}
				}
			}
		}
		printf("%d\n", p[0][0]);
	}
	return 0;
}