#include <bits/stdc++.h>
using namespace std;
const int maxn=100010;
int school[maxn]={0};
int main()
{
int n,num,score;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d%d",&num,&score);
school[num]+=score;
}
int k=1,MAX=-1;
for(int i=1;i<=n;i++)
{
if(school[i]>MAX)
{
k=i;
MAX=school[i];
}
}
printf("%d %d\n",k,MAX);
return 0;
}
1032 挖掘机技术哪家强 (20 分)
最新推荐文章于 2022-01-26 16:09:51 发布