90分求改

#include<iostream>
#include<algorithm>
using namespace std;
struct people{
    int yuwen;
    int shuxue;
    int english;
    int zong;
    int y;
}a[1010];
bool cmp(people a,people b){
    if(a.zong==b.zong){
        if(a.yuwen==b.yuwen){
            return a.y>b.y; 
        }
        return a.yuwen>b.yuwen;
    }
    return a.zong>b.zong;
}
int n;
int main(){
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i].yuwen>>a[i].shuxue>>a[i].english;
        a[i].zong=a[i].yuwen+a[i].shuxue+a[i].english;
        a[i].y=i;
    }
    sort(a+1,a+1+n,cmp);
    for(int i=1;i<=5;i++){
        cout<<a[i].y<<" "<<a[i].zong<<endl;
    }
    return 0;
}