1032 挖掘机技术哪家强

输入样例：

6
3 65
2 80
1 100
2 70
3 40
3 0

输出样例：

2 150

#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=100010;
struct test{
	int id;
	int score;
}t1[maxn];
bool cmp(test a,test b){
	return a.score>b.score;
}
int main(){
	int n,id,score;
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>id>>score;
		t1[id].id=id;
		t1[id].score+=score;	
	}
	sort(t1+1,t1+n,cmp);
	cout<<t1[1].id<<" "<<t1[1].score<<endl;
	return 0;
}