1032 挖掘机技术哪家强 (20 分)
#include<iostream>
using namespace std;
int main()
{
int n,k,h,ch[100101]={0},hh=0,hhh=1;
cin>>n;
for (int i=0;i<n;i++){
cin>>k>>h;
ch[k]+=h;
if (ch[k]>hh) {
hh=ch[k];
hhh=k;
}
}
cout<<hhh<<" "<<hh;
}
1032 挖掘机技术哪家强 (20 分)
#include<iostream>
using namespace std;
int main()
{
int n,k,h,ch[100101]={0},hh=0,hhh=1;
cin>>n;
for (int i=0;i<n;i++){
cin>>k>>h;
ch[k]+=h;
if (ch[k]>hh) {
hh=ch[k];
hhh=k;
}
}
cout<<hhh<<" "<<hh;
}