#include<iostream>
#include<algorithm>
#include<map>
using namespace std;
int main()
{
int n;
cin >> n;
int res[100001] = {0};
for (int i = 0; i < n; i++)
{
int num,score;
cin >> num>>score;
res[num] =res[num]+ score;
}
int max = 0,index=0;
for (int i = 0; i < 100001; i++)
{
if (res[i] > max)
{
index = i;
max = res[i];
}
}
cout << index << " " << res[index];
system("pause");
return 0;
}
PAT 乙级 1032 挖掘机技术哪家强 (20分)
最新推荐文章于 2024-06-05 09:23:24 发布