Cf -- Winner (simulation), cf -- winner Simulation

Cf -- Winner (simulation), cf -- winner Simulation

Winner Time Limit:1000 MS Memory Limit:65536KB 64bit IO Format:% I64d & % I64uSubmit Status

Description

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 participant 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 equalsM) At the end of the game, than wins the one of them who scored at leastMPoints 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 numberN(1 hour ≤ hourN  ≤    1000 ),NIs the number of rounds played. Then followNLines, 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

3mike 3andrew 5mike 2

Output

andrew

Input

3andrew 3andrew 2mike 5

Output

andrew

Play a game with one person scoring or reducing each round. After all rounds are completed, find the person with the highest score. If there are multiple people, find the first person to reach the highest score or higher.

First, save the scores of each person, record the winners, and traverse all the rounds again to find the first winner who is equal to or higher than the score.

#include <cstdio>#include <string>#include <cstring>#include <algorithm>#include <map>using namespace std ;map <string,int> Map ;struct node{    char str[40] ;    int c ;}p[1100] , q[1100] ;int c[1100] , num[1100];int main(){    int n , i , k , cnt = 1 ;    Map.clear() ;    memset(c,0,sizeof(c)) ;    memset(num,0,sizeof(num)) ;    scanf("%d", &n) ;    for(i = 0 ; i < n ; i++)    {        scanf("%s %d", p[i].str, &p[i].c) ;        k = Map[p[i].str] ;        if( k == 0 )        {            k = cnt ;            strcpy(q[k].str,p[i].str) ;            Map[ p[i].str ] = cnt++ ;        }        c[k] += p[i].c ;    }    int max1 = -2000000 ;    for(i = 0 ; i < cnt ; i++)    {        max1 = max(max1,c[i]) ;    }    for(i = 0 ; i < cnt ; i++)    {        if( c[i] == max1 )            num[i] = 1 ;    }    memset(c,0,sizeof(c)) ;    for(i = 0 ; i < n ; i++)    {        k = Map[ p[i].str ] ;        c[k] += p[i].c ;        if( c[k] >= max1 && num[k] )            break ;    }    printf("%s\n", q[k].str) ;    return 0;}