poj_2092

hash+sort

#include<iostream>
#include <algorithm>
using namespace std;

struct myhash{
  int id;
  int num;
} myhash[10010];

bool cmp(struct myhash a,struct myhash b)
{
  if(a.num!=b.num)
	  return a.num>b.num;
  return a.id<b.id;
}

int main()
{
	int n,m;
       //freopen("1.txt","r",stdin);
	while(~scanf("%d%d",&n,&m))
	{
	  if(n==0&&m==0)break;
      int max=1;
		int i;
		for(i=0;i<10003;i++)
		{  myhash[i].num=0;
		  myhash[i].id=0;
		}
		for(i=0;i<n;i++)
		{	for(int j=0;j<m;j++)
			{  int t;
			   scanf("%d",&t);
			   if(t>max)max=t;
			   myhash[t].id=t;
			   myhash[t].num++;
			}
		}
			sort(myhash+1,myhash+max+1,cmp);
				cout<<myhash[2].id;
			for(i=3;i<=n*m;i++)
			{ if(myhash[i].num<myhash[2].num) break;

				cout<<" "<<myhash[i].id;
			}
			cout<<endl;
	   
	  
	}
	
   return 0;
}