A. Winner Codeforences
来源:互联网 发布:黑客帝国进入矩阵 编辑:程序博客网 时间:2024/05/18 01:55
The winner of the card game popular in Berland "Berlogging" is determined according to the following rules. If at the end of the game there is only one player with the maximum number of points, he is the winner. The situation becomes more difficult if the number of such players is more than one. During each round a player gains or loses a particular number of points. In the course of the game the number of points is registered in the line "name score", where name is a player's name, and score is the number of points gained in this round, which is an integer number. If score is negative, this means that the player has lost in the round. So, if two or more players have the maximum number of points (say, it equals to m) at the end of the game, than wins the one of them who scored at least m points first. Initially each player has 0 points. It's guaranteed that at the end of the game at least one player has a positive number of points.
The first line contains an integer number n (1 ≤ n ≤ 1000), n is the number of rounds played. Then follow n lines, containing the information about the rounds in "name score" format in chronological order, where name is a string of lower-case Latin letters with the length from 1 to 32, and score is an integer number between -1000 and 1000, inclusive.
Print the name of the winner.
3mike 3andrew 5mike 2
andrew
3andrew 3andrew 2mike 5
andrew
这个题目的意思是说,每局大家都会有得分,然后有失分,最后分最高的那个人是冠军,假如有多个,最先达到的,算是冠军.
#include<iostream>#include<cstdio>#include<cstring>#include<map>using namespace std;int main(){ int i,j,k,max,n; map<string,int>f,g; string s[1010]; int c[1010]; scanf("%d",&n); for(i=0;i<n;i++) { cin>>s[i]>>c[i]; f[s[i]]=f[s[i]]+c[i]; } for(i=0;i<n;i++) { if(max<f[s[i]]) { max=f[s[i]]; } } /* for(i=0;i<n;i++) { cout<<s[i]<<f[s[i]]<<endl; }*/ for(i=0; f[s[i]]<max||(g[s[i]]+=c[i])<max; ++i); { cout<<s[i]<<endl; } return 0;}
- A. Winner Codeforences
- codeforences 29A
- A. Winner
- A. Winner
- A. Winner
- Codeforences #339 A. Link/Cut Tree
- CF 2A Winner
- codeforce 2A Winner
- codeforces 2A Winner
- CODEFORCES 2A-Winner
- coderforce 2A-Winner
- codeforces 2A. Winner
- Codeforces 2A Winner
- codeforces 2A Winner
- codeforces 2-A Winner
- codeforces 2A.Winner
- Codeforces 2A. Winner
- 2A - Winner
- 验科岗位来
- 浅谈HTTP中Get与Post的区别
- RGB颜色查询对照表
- 3Sum Closest
- 面向对象----C#运算符重载
- A. Winner Codeforences
- 如何聚集高水平研发人员
- 视图调用存储过程全局变量
- 使用EF6和MVC5实现一个简单的选课系统--使用EF6实现继承(11/12)
- Java synchronized详解
- SEO时代已成为过去,??已经到来
- STL源码剖析笔记
- Hibernate数据持久化及update更新问题
- 使用EF6和MVC5实现一个简单的选课系统--EF6的高级用法(12/12)