简单的题目

# include <bits/stdc++.h>
using namespace std;
int n, k[1001], N = -100000000000;
string name[1001];
map <string, int> m;
map <string, int> a;
int main() {
    cin >> n;
    for (int i = 0; i < n; i++) {
    	cin >> name[i] >> k[i];
    	m[name[i]] += k[i];
    	a[name[i]] += k[i]; 
	}
	for (int i = 0; i < n; i++) {
		N = max(N, m[name[i]]);
	    m[name[i]] = 0;
	}
	for (int i = 0; i < n; i++) {
		m[name[i]] += k[i];
		if (m[name[i]] >= N && a[name[i]] == N) {
			cout << name[i];
			return 0;
		}
	}
	return 0;
}