c++PAT挖掘机

#include<iostream>
#include<map>
struct student
{
    int i;
    int j;
};
using namespace std;
int main()
{
    map<int,int> res;
    int n;
    cin>>n;
    student arr[n];
    for(int i=0;i<n;i++)
    {
        cin>>arr[i].i>>arr[i].j;
        res[arr[i].i];
        res[arr[i].i]+=arr[i].j;
    }
    int sum=0;
    int j;
    for(const auto w:res)
    {
        if(w.second>sum)
        {
            sum=w.second;
            j=w.first;
        }
    }
    cout<<j<<" "<<res[j];
    return 0;
}

猜你喜欢

转载自blog.csdn.net/qq_37566910/article/details/78252243