codeforces 2A-Winner (map)
来源:互联网 发布:表单数据 编辑:程序博客网 时间:2024/06/15 00:42
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", wherename 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 tom) at the end of the game, than wins the oneof them who scored at leastm 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 follown lines, containing the information about the rounds in "name score" format in chronological order, wherename is a string of lower-case Latin letters with the length from 1 to 32, andscore 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<stdio.h>#include<map>#include<iostream>#include<string>#include<string.h>using namespace std;struct p{ string strr; int num;}a[2005];map<string,int> p;map<string,int> q;int main(){ int n; int ans=-99999999; p.clear(); q.clear(); string str2; cin>>n; map<string,int>::iterator iter; for (int i=1;i<=n;i++) { string str; int score; cin>>str>>score; a[i].strr=str; a[i].num=score; if (p.find(str)==p.end()) p[str]=0; p[str]+=score; } for (iter=p.begin();iter!=p.end();iter++) { if (iter->second>ans) ans=iter->second; } for (int i=1;i<=n;i++) { if (p[a[i].strr]==ans) { q[a[i].strr]+=a[i].num; if (q[a[i].strr]>=ans) { cout<<a[i].strr<<endl; break; } } } return 0;}
- codeforces 2A-Winner (map)
- Codeforces 2A Winner (map运用)
- CodeForces 2A Winner(map模拟)
- codeforces 2A Winner
- CODEFORCES 2A-Winner
- codeforces 2A. Winner
- Codeforces 2A Winner
- codeforces 2A Winner
- codeforces 2-A Winner
- codeforces 2A.Winner
- Codeforces 2A. Winner
- Codeforces 2A :winner
- CodeForces 2A-Winner
- 【codeforces#2A】Winner
- CodeForces#2A Winner
- CodeForces 2A. Winner
- Codeforces #2 A Winner
- Codeforces 2 A. Winner
- Mysql server zip版安装
- java关键字static
- Android 那些你所不知道的Bitmap对象详解
- 计蒜客 联想专卖店大促销
- struts2 面试题
- codeforces 2A-Winner (map)
- DEV调试C++项目实例
- SimpleAdapter的应用
- jvm垃圾收集器配置-1
- 下面哪些特性可能导致代码体积膨胀:----腾讯2016研发工程师在线模拟笔试题
- ATOM基础教程一ATOM自定义代码片段(8)
- bzoj1026 [SCOI2009]windy数(数位dp)
- C语言培训_005
- [POJ3133]Manhattan Wiring 插头dp