CodeForces 2A

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.

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.

Sample Input

Input

3
mike 3
andrew 5
mike 2

Output

andrew

Input

3
andrew 3
andrew 2
mike 5

Output

andrew
【题目大意】
输入每组游戏赢家的得分，找出得分最高且最先获得大于等于游戏终止时的最高分的玩家。
【思路】
使用map，进行两次模拟，第一次找到最高分，第二次找到最先获得最高分的选手。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <map>

using namespace std;
char a[1010][55];
int n[2005];

int main()
{
    map<string,int>map1, map2;
    int m;
    while(scanf("%d", &m)!=EOF)
    {
        int maxi = -1000;
        for(int i=0; i<m; i++)
        {
            scanf("%s%d", a[i], &n[i]);
            map1[a[i]] += n[i];
        }
        for(int i=0; i<m; i++)
        {
            if(map1[a[i]] > maxi)
                maxi = map1[a[i]];
        }
        for(int i=0; i<m; i++)
        {
            map2[a[i]] += n[i];
            if(map2[a[i]] >= maxi && map1[a[i]] == maxi)
            {
                printf("%s\n", a[i]);
                break;
            }

        }
    }
    return 0;
}