CodeForces#2A Winner

A. Winner

time limit per test

1 second

memory limit per test

64 megabytes

input

standard input

output

standard output

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 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.

Input

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.

Output

Print the name of the winner.

Examples

input

3mike 3andrew 5mike 2

output

andrew

input

3andrew 3andrew 2mike 5

output

andrew

很多人玩一个游戏，每一轮有一个人得分或者扣分，最后分数最高的人夺冠；如果最后有多个人分数都是最高的，则这些人里面，在比赛过程中首先达到或者超过这个分数的人夺冠。现在给定最多1000轮每轮的情况，求最后的冠军是谁。

#include <cstdio>#include <iostream>#include <cstring>#include <algorithm>#include <string>#include <cmath>#include <map>using namespace std;const int maxn = 1007;const int maxstr = 36;char str[maxn][maxstr];int score[maxn];int main(){    int n;    while (~scanf("%d", &n)){        map<string, int> name, nametmp;        int ans = 0;        for (int i = 0; i < n; i++){            scanf("%s%d", str[i], &score[i]);            name[str[i]] += score[i];        }        for (int i = 0; i < n; i++){            if (name[str[i]] > ans){                ans = name[str[i]];            }        }        for (int i = 0; i < n; i++){            if (name[str[i]] == ans){                nametmp[str[i]] += score[i];               // printf("%s %d\n", str[i], nametmp[str[i]]);                if (nametmp[str[i]] >= ans){                   // printf("%s", str[i]);                    puts(str[i]);                    break;                }            }        }    }    return 0;}