大佬救命

#include <iostream>
#include <algorithm>
using namespace std;

struct stu {
	int num;
	int chinese,math,english;
	int sum;
}student[305];
int n;
bool cmp(stu a, stu b){
	if (a.sum > b.sum) return 1;
	else if(a.sum < b.sum) return 0;
	else{
		if(a.chinese > b.chinese) return 1;
		else if(a.chinese < b.chinese) return 0;
		else{
			if(a.num > b.num) return 1;
			else return 0;
		}
	}
}

int main(){
	cin >> n;
	for(int i = 1 ; i <= n ; i++){
		student[i].num = i;
		cin >> student[i].chinese >> student[i].math>>student[i].english;
		student[i].sum = student[i].chinese+student[i].math+student[i].english;
		
	}
	sort(student+1,student+1+n,cmp);
	for(int i = 1 ; i <= 5 ; i++){
		cout << student[i].num << ' ' <<student[i].sum;
		cout << endl;
	}
	return 0;
}