POJ 2092 Grandpa is Famous water

Grandpa is Famous

Time Limit: 2000MS		Memory Limit: 30000K
Total Submissions: 7985		Accepted: 4007

Description

The whole family was excited by the news. Everyone knew Grandpa had been an extremely good bridge player for decades, if it was announced he would being in the G Uinness Book of World Records as the most successful bridge player ever, whow, which was astonishing!
The International Bridge Association (IBA) has maintained, for several years, a weekly ranking of the best players in the World. Considering the appearance in a weekly ranking constitutes a point for the player, Grandpa is nominated the best pl Ayer ever because he got the highest number of points.
Have many friends who were also competing against him, Grandpa are extremely curious to know which player (s) took the SEC Ond place. Since the IBA rankings is now available on the Internet he turned to your for help. He needs a program which if given a list of weekly rankings, finds out which player (s) got the second place according t o the number of points.

Input

The input contains several test cases. Players is identified by integers from 1 to 10000. The first line of a test case contains integers N and M indicating respectively the number of rankings available (2 &L t;= N <=) and the number of players in each ranking (2 <= M <= 500). Each of the next N lines contains the description of one weekly ranking. Each description was composed by a sequence of M integers, separated by a blank space, identifying the players who figured In that weekly ranking. Can assume that:

• In all test case there are exactly one best player and at least one second best player,
  
• Each weekly ranking consists of M distinct player identifiers.

The end of input is indicated by N = M = 0.

Output

For each test case in the input your program must produce one line of output, containing the identification number of the Player who is second best in number of appearances in the rankings. If there is a tie for second best, print the identification numbers of all second best players in increasing order. Each identification number produced must is followed by a blank space.

Sample Input

4 520 33 25 32 9932 86 99 25 1020 99 10 33 8619 33 74 99 323 62 34 67 36 79 93100 38 21 76 91 8532 23 85 31 88 10 0

Sample Output

32 331 2 21 23 31 32 34 36 38 67 76 79 88 91 93 100

Source

South America 2004
1 A
Accode:

#include <map> #include <queue> #include <cmath> #include <cstdio> #include <cstring># Include <stdlib.h> #include <iostream> #include <algorithm> #define MAXN 100using namespace Std;struct    m{int id; int time;}    Me[10000+5];int isused[10000+5];int Is[10000+5];bool cmp (M a,m b) {if (a.time!=b.time) return a.time>b.time; return a.id<b.id;}    int main () {int n,m,t,count; while (scanf ("%d%d", &n,&m)!=eof&& (n| |        m)) {count=0;        memset (isused,0,sizeof (isused));        Memset (Is,0,sizeof (IS));                for (int i=0;i<n;++i) {for (int j=0;j<m;++j) {scanf ("%d", &t);                    if (isused[t]==0) {//printf ("yes!\n");                    me[count].id=t;                    me[count].time=1;                    isused[t]=11;                    Is[t]=count;                count++;                }else {me[is[t]].time++;          }  }} sort (me,me+count,cmp);       printf ("%d", me[1].id); for (int i=2;;            ++i) {if (me[i].time!=me[i-1].time) break;       printf ("%d", me[i].id);    } putchar (' \ n '); } return 0;}

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

POJ 2092 Grandpa is Famous water