1032. Which excavator technology is strong (20)

#include<iostream>

#include<cstdio>

#include<cstring>

#include<string>

#include<cmath>

#include<set>

#include<cctype>

#include<algorithm>

#include<map>

using namespace std;

intmain()

{

    int m,n,k,s;

    cin>>k;

    int MAX=0;

     map<int ,int> mp;

      mp.clear();

    while(k--)

    {

      cin>>m>>n;

      mp [m] + = n;

      if(mp[m]>MAX)

      {

          s=m;

          MAX=mp[m];

      }

    }

  cout<<s<<" "<<MAX<<endl;

  return 0;

}