代码:
#include <stdio.h>
#include <map>
#include <vector>
#include <string>
#include <queue>
#include <algorithm>
#include <iostream>
using namespace std;
const int MAXN = 1001;
map<string, int> M, P;
string input[MAXN];
int scores[MAXN];
int main()
{
#ifdef _LOCAL
freopen("F://input.txt", "r", stdin);
#endif
int n;
scanf("%d", &n);
for(int i = 0; i < n; ++i)
{
cin >> input[i] >> scores[i];
M[input[i]] += scores[i];
}
int Max;
for(int i = 0; i < n; ++i)
Max = max(Max, M[input[i]]);
for(int i = 0; i < n; ++i)
{
if(M[input[i]] == Max)
{
P[input[i]] += scores[i];
if(P[input[i]] >= Max)
{
cout << input[i];
break;
}
}
}
return 0;
}