PAT B1032 挖掘机技术哪家强

include <iostream>
using namespace std;

const int maxn = 100010;
int school[maxn] = {0};

int main()
{
    int n, schID, score;
    cin >> n;
    for (int i = 0; i < n; i++){
        cin >> schID >> score;
        school[schID] += score;
    }

    int k, MAX = -1;
    for (int i = 1; i<= n; i++){
        if(school[i] > MAX){
            max = school[i];
            k = i;
        }
    }

    cout << k << ' ' << MAX;
    return 0;
}