#pragma warning(disable:4996)
#include<iostream>
using namespace std;
int main()
{
int n,maxid,maxsocre=0;
int socre[100010] = { 0 };
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
int tempid, tempsocre;
scanf("%d %d", &tempid, &tempsocre);
socre[tempid] = socre[tempid] + tempsocre;
if (socre[tempid] > maxsocre)
{
maxsocre = socre[tempid];
maxid = tempid;
}
}
printf("%d %d", maxid, maxsocre);
}
PAT乙级1032 挖掘机技术哪家强 (20分)
最新推荐文章于 2024-06-05 09:23:24 发布