Description
The International Bridge Association (IBA) has maintained, for several years, a weekly ranking of the best players in the world. Considering that each appearance in a weekly ranking constitutes a point for the player, grandpa was nominated the best player ever because he got the highest number of points.
Having many friends who were also competing against him, grandpa is extremely curious to know which player(s) took the second place. Since the IBA rankings are now available in the internet he turned to you for help. He needs a program which, when given a list of weekly rankings, finds out which player(s) got the second place according to the number of points.
Input
- in each test case there is 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
Sample Input
4 5 20 33 25 32 99 32 86 99 25 10 20 99 10 33 86 19 33 74 99 32 3 6 2 34 67 36 79 93 100 38 21 76 91 85 32 23 85 31 88 1 0 0
Sample Output
32 33 1 2 21 23 31 32 34 36 38 67 76 79 88 91 93 100
题目分析
爷爷因为得分最高而被提名为最好的球员。 有很多朋友也在和他竞争,爷爷非常好奇地知道哪个玩家是第二名。由于IBA的排名现已在互联网上提供,所以他转而向你寻求帮助。他需要一个程序。
输入N*M,N就是N次比赛,M是个人成绩,也是个人身份。
N次比赛中出现次数最多的就是爷爷,要输出出现次数仅此于爷爷的所有人
解题思路
是输出数字出现次数第二多的数字,并且按顺序输出。即先获取最大的值然后据此找到第二大的值。
源代码
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
struct play
{
int num;
int s;
};
bool cmp(play a,play b)
{
if(a.s==b.s)
return a.num<b.num;
else
return a.s>b.s;
}
int main()
{
int n,m,i,j;
while(scanf("%d%d",&n,&m))
{
play p[10003];
memset(p,0,sizeof(p));
int temp;
if(n==0 && m==0)
break;
for(i=0;i<n;i++)
for(j=0;j<m;j++)
{
scanf("%d",&temp);
p[temp].num=temp;
p[temp].s++;
}
sort(p,p+10000,cmp);
i=1;
while(p[i].s==p[i+1].s)
{
printf("%d ",p[i].num);
i++;
}
printf("%d\n",p[i].num);
}
return 0;
}