80分求大牢指点

#include<bits/stdc++.h>
using namespace std;
struct st{
	int num;
	int ch,ma,en;
	int score;
}a[305];
bool cmp(st x,st y){
	if(x.score>y.score){
		return 1;
	}
	else if(x.score==y.score){
		if(x.ch>y.ch){
			return 1;
		}
		else if(x.ch=y.ch){
			if(x.num<y.num){
				return 1;
			}
		}
	}
	return 0;
}
int main(){
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].ch>>a[i].ma>>a[i].en;
		a[i].score=a[i].ch+a[i].ma+a[i].en;
		a[i].num=i;
	}
	sort(a+1,a+n+1,cmp);
	for(int i=1;i<=5;i++){
		cout<<a[i].num<<" "<<a[i].score<<endl;
	}
	return 0;
}