水题
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <cstring>
#include <cmath>
#include <cstdlib>
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
using namespace std;
int main(int argc, char** argv) {
int n;
scanf("%d",&n);
int number[100005] = {0};
for(int i=0;i<n;i++)
{
int a,b;
scanf("%d%d",&a,&b);
number[a] += b;
}
int max = number[0];
int p = 0;
for(int i=1;i<=n;i++)
{
if(number[i]>max)
{
max = number[i];
p = i;
}
}
printf("%d %d\n",p,max);
return 0;
}