2148599_ac_125ms_128k.cpp

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

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

int p[10001], q[10001];

void init()
{
	int i;

	for(i = 0; i < 10001; i++)
	{
		p[i] = i;
		q[i] = 0;
	}
}

bool cmp(int a,int b)
{
	if(q[a]!=q[b])
		return q[a]>q[b];
	else
		return a<b;
}

void input()
{
	int i, j, tmp;
	int N, M;

	while(scanf("%d%d",&N,&M)==2&&N)
	{
		init();
		for(i = 0; i < N; i++)
			for(j = 0; j < M; j++)
			{
				scanf("%d",&tmp);
				q[tmp]++;
			}
		std::sort(p,p+10000,cmp);
		for(i = 1; q[p[i]]==q[p[1]]; i++)
			printf("%d ",p[i]);
		printf("\n");
	}
}

int main()
{
	input();
	return 1;
}