2021年-PTA模拟赛-L1-8 编程团体赛(仅代码)

没必要存进去再遍历数组，数组就起一个记忆的作用，我还没想到有什么优化的办法。

AcCode:

#include<bits/stdc++.h>
using namespace std;
int team[10010];
int main(){
    int winner = 0, max = 0, N;
    cin >> N;
    while(N--){
        int tid, id, g;
        scanf("%d-%d %d", &tid, &id, &g);
        team[tid] += g;
        if(team[tid] > max) max = team[tid], winner = tid;
    }
    cout << winner << " " << max;
    return 0;
}