PAT乙级 挖掘机技术哪家强 （c++）

✨采用map来存储

#include<iostream>
#include<map>
using namespace std;
int main(){
    int n;
    cin>>n;
    map<int,long> mapgrade;
    for(int i=0;i<n;i++){
       int num;
       int grade;
       cin>>num>>grade;
       mapgrade[num] = mapgrade[num] + grade;
    }
    int max1 = -1;
    int maxi = 0;
    for(int i=0;i<mapgrade.size();i++){
        if(mapgrade[i]>max1){
            max1 = mapgrade[i];
            maxi = i;
        }
    }

    cout<<maxi<<" "<<max1<<endl;
}