解题思路:一维数组存储,并用max_element寻找数组的最大值即可
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int a[n+1];
memset(a,0,sizeof(a));
for(int i=1;i<=n;i++){
int num,sum;
cin>>num>>sum;
a[num]+=sum;
}
int max=*max_element(a+1,a+n+1);
for(int i=1;i<n+1;i++){
if(a[i]==max){
cout<<i<<" "<<max;
break;
}
}
}
运行结果:![](https://i-blog.csdnimg.cn/blog_migrate/b378aa735ae270fafbd248d045ea4179.png)