CF2A. Winner

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

3mike 3andrew 5mike 2

output

andrew

input

3andrew 3andrew 2mike 5

output

andrew

题目大意：每局大家都会有得分，然后有失分，最后分最高的那个人是冠军，假如有多个，最先达到的，算是冠军.

刚开始看到这个题感觉和Hdu 1004差不多，于是就用map写的，但是wa了，不知道什么原因，测试数据都对了，求大神详解：
#include <iostream>#include <cstdio>#include <string>#include <map>using namespace std;int main (){int n;while(cin>>n){map<string,int>s;string str;int m;for(int i=1;i<=n;i++){cin>>str>>m;        s[str]+=m;        //cout<<s[str]<<endl;}int max=-1;string ans;map<string,int>::iterator it;for(it=s.begin();it!=s.end();it++){if(max<it->second){ans=it->first;max=it->second;}}cout<<ans<<endl;}return 0;}

后来看了一下大神的博客，看到了AC代码，但是不知道自己的代码为什么错误

AC代码：

#include<iostream>#include<cstdio>#include<cstring>#include<map>using namespace std;int main(){    int i,j,k,max,n;    map<string,int>f,g;    string s[1010];    int c[1010];    scanf("%d",&n);    for(i=0; i<n; i++)    {        cin>>s[i]>>c[i];        f[s[i]]=f[s[i]]+c[i];    }    for(i=0; i<n; i++)    {        if(max<f[s[i]])        {            max=f[s[i]];        }    }    /* for(i=0;i<n;i++)    {        cout<<s[i]<<f[s[i]]<<endl;    }*/    for(i=0; f[s[i]]<max||(g[s[i]]+=c[i])<max; ++i);    {        cout<<s[i]<<endl;    }    return 0;}