0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-24 01:28:49 +00:00

CF2A Winner

R42010428
This commit is contained in:
Baoshuo Ren 2020-11-16 19:16:41 +08:00 committed by Baoshuo Ren
parent f988e1372a
commit e2c361566e
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68

27
problem/CF2A/CF2A.cpp Normal file
View File

@ -0,0 +1,27 @@
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, max_score = -0x3f3f3f3f;
int scores[1005];
string s, max_player, players[1005];
map<string, int> m, m1;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> players[i] >> scores[i];
m[players[i]] += scores[i];
}
for (int i = 0; i < n; i++) {
max_score = max(max_score, m[players[i]]);
}
for (int i = 0; i < n; i++) {
m1[players[i]] += scores[i];
if (m[players[i]] == max_score && m1[players[i]] >= max_score) {
max_player = players[i];
break;
}
}
cout << max_player << endl;
return 0;
}