二分贪心x
来源:互联网 发布:淘宝保健品标题怎么改 编辑:程序博客网 时间:2024/06/06 14:06
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
#include<iostream>#include<string.h>using namespace std;int d[10001];int main(){int a,b,e,i,x;while(cin>>a>>b){ memset(d,0,sizeof(d)); x=1;if(a==0&&b==0)break;for(i=0;i<a*b;i++){cin>>e;d[e]++;}int max=-1;for(i=1;i<10001;i++){if(max<d[i])max=d[i];}for(i=1;i<10001;i++){if(d[i]==max)d[i]=-1;}max=-1;for(i=1;i<10001;i++){if(d[i]>max)max=d[i];}for(i=1;i<10001;i++){if(d[i]==max)cout<<i<<' ';}cout<<endl;}}
本题即求第二多的数的位置
0 0
- 二分贪心 X
- 二分贪心—X
- 二分贪心-X
- 二分贪心x
- 二分贪心 X 比赛排名
- ACM-二分贪心X-24
- 二分+贪心
- 贪心 + 二分
- 贪心二分
- 贪心+二分
- 贪心(bnuoj49103+二分+贪心)
- BNU 49103 贪心【二分+贪心】
- hdu pie(二分+贪心)
- POJ3497 Assemble 二分+贪心
- mysterious 二分加贪心
- HDU 3650 贪心+二分
- 11627 - Slalom (二分+贪心)
- 二分+贪心+LA3177
- Docker Swarm 入门
- 在IntelliJ IDEA上使用Maven搭建SSM框架(三)
- java 日历查询
- zlib和openssl相关库错误的解决
- 【EJB】Developing EJB Applications -- Chapter6(EJB应用安全)
- 二分贪心x
- 常见对象-Object类
- Android的与服务器端传送信息使用JSON类-JSONObject与JSONArray的使用
- Linux问题—VMware中Linux和Windows共享文件夹
- TCP小结
- LineRenderer在unity5.5中的使用,新手使用攻略
- Ruby on Rails学习笔记(五 常用操作)
- Python 单线程与多线程批量下载的比较
- 使用GitLab、Jenkins、Docker建立快速持续化集成交付部署方案