2A.md (1700B)
1 Source: https://codeforces.com/problemset/problem/2/A 2 3 A. Winner 4 5 time limit per test 6 7 1 second 8 9 memory limit per test 10 11 64 megabytes 12 13 input 14 15 stdin 16 17 output 18 19 stdout 20 21 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. 22 23 Input 24 25 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. 26 27 Output 28 29 Print the name of the winner. 30 31 Examples 32 33 Input 34 35 ``` 36 3 37 mike 3 38 andrew 5 39 mike 2 40 ``` 41 42 Output 43 44 ``` 45 andrew 46 ``` 47 48 Input 49 50 ``` 51 3 52 andrew 3 53 andrew 2 54 mike 5 55 ``` 56 57 Output 58 59 ``` 60 andrew 61 ```