PAT 乙级 1032

不难

#include<iostream>using namespace std;struct nood{int a,b;};bool cmp(int a,int b){return a>b;}int main(){nood c[100000];int n;cin>>n;int g,h;int sum[100000]={0};for(int i=0;i<n;i++){cin>>c[i].a>>c[i].b;}for(int i=0;i<n;i++){if(sum[c[i].a]!=0)  sum[c[i].a]+=c[i].b;else  sum[c[i].a]=c[i].b;  }int k;int max=0;for(int i=0;i<100000;i++){if(sum[i]>max){max=sum[i];k=i;}}cout<<k<<" "<<sum[k]<<endl;return 0;}