X
来源:互联网 发布:埃米纳姆 知乎 编辑:程序博客网 时间:2024/04/28 20:27
Description
The whole family was excited by the news. Everyone knew grandpa had been an extremely good bridge player for decades, but when it was announced he would be in the Guinness Book of World Records as the most successful bridge player ever, whow, that was astonishing!
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.
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
The input contains several test cases. Players are identified by integers from 1 to 10000. The first line of a test case contains two integers N and M indicating respectively the number of rankings available (2 <= N <= 500) 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 is composed by a sequence of M integers, separated by a blank space, identifying the players who figured in that weekly ranking. You can assume that:
The end of input is indicated by N = M = 0.
- 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
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 be 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
解题思路:
统计每个数出现的个数,按升序输出出现次数第二多的数
细节处理:
用cin,cout超时
代码:
#include <iostream>#include<vector>#include<fstream>#include<algorithm>using namespace std;struct secondd{ int num; int sum;};bool comp (const secondd & a,const secondd & b){return a.sum<b.sum;}int main(){ //freopen("aaa.txt","r",stdin); //ifstream cin("aaa.txt"); int n,m,i,j,r,a; while(cin>>n>>m) { if(m==0&&n==0) break; secondd s[10001]; for(i=0;i<=10000;i++) {s[i].sum=0;s[i].num=i;} r=0; for(i=1;i<=n;i++) for(j=1;j<=m;j++) { scanf("%d",&a); s[a].sum++; } sort(s,s+10001,comp); vector<int>v; for(i=9999;i>=1;i--) { if(s[i].sum==s[9999].sum) v.push_back(s[i].num); else break; } sort(v.begin(),v.end()); for(i=0;i<v.size();i++) printf("%d ",v[i]); printf("\n"); } return 0;}
0 0
- $X
- X
- X
- X
- x
- x
- X
- /x
- x
- x
- x
- x
- x
- X
- x
- X
- %x
- +-x/
- Lowest Common Ancestor of a Binary Search Tree
- Unity ShaderLab: 2D/3D Wave Flag Shader(飘动旗帜)的实现
- C#文件IO流详解
- 基于matlab的简单的寻找波峰波谷处理方法
- Android 反编译使用 图解(详解)
- X
- Android StudioDay03-3(键盘导航)
- 欢迎使用CSDN-markdown编辑器
- TabLayout的使用和踩过的坑
- 自己写的一个模板栈的头文件
- Socket套接字-----最流行的网络通信程序接口之一
- 内核异步式IO(fasync)
- spring boot -- 打包jar,war(一)
- Repeat Number