80分求助

蒟蒻80求助

    #include<iostream>

    #include<cstdio>

    #include<windows.h>

      #include<cmath>

     #include<iomanip>

     #include<algorithm>

     #include<cstring>

     #include<queue>//队列

     #include<stack>//栈

     #include<ctime>

    using namespace std;

     int n,b,c;

    struct node{

     int h,z,a;

    };

     node p[310];

     bool cmp(node a1,node a2){

    return a1.z>a2.z;

     }

    int main(){

    cin>>n;

     for(int i=1;i<=n;i++){

                        p[i].h=i;

                        cin>>p[i].a>>b>>c;

     p[i].z=p[i].a+b+c;

    }

    sort(p+1,p+n+1,cmp);
    for(int i=1;i<=n;i++){
        if(p[i].z==p[i+1].z&&p[i].a<p[i+1].a){
            swap(p[i].z,p[i+1].z);
            swap(p[i].a,p[i+1].a);
            swap(p[i].h,p[i+1].h);
        }
        else if(p[i].z==p[i+1].z&&p[i].a==p[i+1].a&&p[i].h>p[i+1].h){
            swap(p[i].z,p[i+1].z);
            swap(p[i].a,p[i+1].a);
            swap(p[i].h,p[i+1].h);
        }
    }
    for(int i=1;i<=5;i++){
        cout<<p[i].h<<" "<<p[i].z<<endl;
    }

    return 0;
}