胜利者

描述：

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.

Berland流行的纸牌游戏“Berlogging”的胜利者根据一下规则规定。如果在游戏的最后只有一个玩家有最大的点数，他就是最后赢家。如果玩家超过一个人，情况会变得更难。每个回合玩家获得或失去一个特定的积分。在游戏过程中，点数记录在“名字得分”中，名字是指玩家的姓名。如果分数为负数，这意味着玩家在这回合中输了。所以，如果有两个玩家或者更多在游戏结束有最高得分（假设为m),最后赢家就是最早获得最高分的人。初始时，每个玩家都只有0分。这保证在游戏结束至少有一个人的分数为正数。

输入：

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.

第一行输入包含一个整数n（1<=n<=1000)，n是每一回合玩家的人数。接下来输入n行，按时间顺序包含有关“名称分数”格式的回合信息。其中，名称是1~32位的小写字母，分数是-1000~1000的整数。

输出：

Print the name of the winner.

输出胜利者的姓名。

样例输入：

3
mike 3
andrew 5
mike 2

样例输出：

andrew

样例输入：

3
andrew 3
andrew 2
mike 5

样例输出：

andrew

https://acs.jxnu.edu.cn/problem/CF2Ahttps://acs.jxnu.edu.cn/problem/CF2A

1.20 Winner相关推荐

c语言报数问题程序,转圈报数问题（C语言）：有n个人围成一圈，顺序排号……...
问题描述: 有n个人围成一圈,顺序排号.从第1个人开始报数(从1到3报数),凡报到3的人退出圈子,问最后留下的是原来第几号那位. 题目分析: 这道题目是我们在日常生活中也能经常见到的一种报数小游戏.首 ...
python分析比赛_实战项目练习 ---- 【2018世界杯】用python分析夺冠球队
2018世界杯前言在网上找到了个用Python分析2018世界杯夺冠热门的项目,感觉很有意思准备拿来练练手. 因为目前还没有学到图形可视化部分,所以这部分内容会完全借鉴网上的教程. 分析目的通过 ...
转圈报数问题（C语言）：有n个人围成一圈，顺序排号……
问题描述: 有n个人围成一圈,顺序排号.从第1个人开始报数(从1到3报数),凡报到3的人退出圈子,问最后留下的是原来第几号那位. 题目分析: 这道题目是我们在日常生活中也能经常见到的一种报数小游戏.首 ...
利用php屏蔽海外ip访问，高效实现
<?php/*** 屏蔽海外ip访问* 使用ip2long函数得到ip转为整数的值,判断值是否在任一一个区间中* 以下是所有国内ip段* 调用方法:IschinaIp($ALLIPS)* 返回值 ...
pat1011. World Cup Betting (20)
1011. World Cup Betting (20) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Wit ...
【leetcode】486. Predict the Winner
题目如下: Given an array of scores that are non-negative integers. Player 1 picks one of the numbers fro ...
浙江大学PAT上机题解析之1011. World Cup Betting (20)
1011. World Cup Betting (20) 时间限制 400 ms 内存限制 32000 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN ...
【PAT (Advanced Level) Practice】1041 Be Unique (20 分)
1041 Be Unique (20 分) Being unique is so important to people on Mars that even their lottery is desi ...
【PAT (Advanced Level) Practice】1124 Raffle for Weibo Followers (20 分)
1124 Raffle for Weibo Followers (20 分) John got a full mark on PAT. He was so happy that he decided ...

1.20 Winner

胜利者

描述：

输入：

输出：

样例输入：

样例输出：

样例输入：

样例输出：

1.20 Winner相关推荐

最新文章

热门文章