1.23我的第七篇

题目链接：https://acs.jxnu.edu.cn/problem/CF2A

题目: Winner

题目描述：

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.

我的翻译：

有一种游戏在Berland很受欢迎，他的规则如下：如果在游戏结束时，只有一个人的得分最高，那么他就是冠军。如果有多个人的得分一样且最大，那么谁最先得到最高谁就是冠军。“ name   score ”分别代表 一个人的名字以及分数，如果一个人得了负分，那么他在这个回合就输了每个人刚开始的分数都是0。保证在游戏结束时有一个人的分数为正数。

输入：

第一行 “ n ”(1<=n<=1000),表示有n个人参加游戏，接下来的有 “ n ”行，每一行都是人的名字以及得分（“ name   score ”），名字是字母且长度在 1 到 32 之间，得分是一个整数且在-1000与1000之间。

输出：冠军的名字 。