A. Winner

A. Winner
time limit per test1 second
memory limit per test64 megabytes
inputstandard input
outputstandard 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", 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 test(s)
Input
3

mike 3

andrew 5

mike 2O

utput
andrew

Input
3

andrew 3

andrew 2

mike 5

Output

andrew

#include<iostream>
#include<map>
#include<algorithm>
#include<cstdio>
#include<string.h>
using namespace std;
string aa[1100];
string cc[1100];
int bb[1100];
map<string,int> Map;
map<string,int> Map1;
int main()
{
    int len;
    string a;
    string ans;
    int b;
    int max;
    while(cin>>len)
    {
        max=-10000000;
        for(int i=0; i<len; i++)
        {
            cin>>aa[i];
            cin>>bb[i];
            if(Map[aa[i]]==0)
                Map[aa[i]]=bb[i];
            else
                Map[aa[i]]+=bb[i];
            Map1[aa[i]]=0;
        }
        int step;
          map<string,int>::iterator p;
          for(p=Map.begin(); p!=Map.end(); p++)
          {
              if(Map[p->first]>max)
              {
                  max=Map[p->first];
                  
              }
          }
        for(int i=0; i<len; i++)//如果最后有多个人分数都是最高的，则这些人里面，在比赛过程中首先达到或者超过这个分数的人夺冠。
        {//这个地方理解错了 我刚开始认为 是找一个最先达到最大值的人。
            Map1[aa[i]]+=bb[i];
            if( Map1[aa[i]]>=max)
            {
                ans=aa[i];
                break;
            } 
        }
        cout<<ans<<endl;
        Map.clear();
        Map1.clear();
        for(int i=0; i<len; i++)
        {
            aa[i]='0';
            bb[i]=0;
        }
    }
    return 0;
}