80分求助

#include<bits/stdc++.h>
using namespace std;
struct student{
    int xh;
    int yw;
    int sx;
    int yy;
    int zf;
}a[400];
int n;
bool comp1(student x,student y)
{
    return x.yw>y.yw;
}
bool comp2(student x,student y)
{
    return x.xh>y.xh;
}
bool comp3(student x,student y)
{
    return x.zf>y.zf;
}
int main()
{
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i].yw>>a[i].sx>>a[i].yy;
        a[i].zf=a[i].yw+a[i].sx+a[i].yy;
        a[i].xh=i;
    }
    sort(a+1,a+n+1,comp3);
    for(int i=1;i<=n;i++)
    {
        if(a[i].zf==a[i+1].zf)
        {
            if(a[i].yw<a[i+1].yw)
            {
                swap(a[i].xh,a[i+1].xh);
            }   
        }
    }
    for(int i=1;i<=5;i++)
    {
        cout<<a[i].xh<<" "<<a[i].zf<<endl;
    }
    return 0;
}