感觉思路挺清晰的，但#14一直不过。

#include<bits/stdc++.h>
#define debug puts("bug\n")
using namespace std;
int read()
{
    int x=0,f=1;
    char ch=getchar();
    while(ch>'9'||ch<'0')
    {
        if(ch=='-') f=-1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9')
    {
        x=(x<<3)+(x<<1)+(ch^48);
        ch=getchar();
    }
    return x*f;
}
void write(int a)
{
    if(a<0)
    {
        putchar('-');
        a=-a;
    }
    if(a>9) write(a/10);
    putchar(a%10+'0');
}
typedef struct node
{
    string name;
    int score;
    int order; // 更新到最大值时的次序
    int maxscore; // 历史最大分数
}Node;
Node player[1005];
map<string,bool> judge; // 判断名字是否出现过
map<string,int> toid; // 返回序号
bool cmp(const Node& a,const Node& b)
{
    if(a.score!=b.score) return a.score>b.score;
    return a.order<b.order;
}
int main()
{
    int n=read();
    int num=0;
    for(int i=1;i<=n;i++)
    {
        string s;
        cin>>s;
        int score=read();
        if(!judge[s])
        {
            judge[s]=true;
            player[++num].name=s;
            player[num].score=score;
            if(player[num].score>player[num].maxscore)
            {
                player[num].order=i;
                player[num].maxscore=player[num].score;
            }
            toid[player[num].name]=num;
        }
        else
        {
            player[toid[s]].score+=score;
            if(player[toid[s]].score>player[toid[s]].maxscore)
            {
                player[toid[s]].order=i;
                player[toid[s]].maxscore=player[toid[s]].score;
            }
        }
    }
    sort(player+1,player+num+1,cmp);
//    for(int i=1;i<=num;i++)
//    {
//        cout<<player[i].name<<" "<<player[i].score<<" "<<player[i].order<<endl;
//    }
    cout<<player[1].name<<endl;
    return 0;
}