0pts求条

代码如下：

#include <bits/stdc++.h>

using namespace std;
int n;
struct node{
    int num;
    int ch,ma,en;
    int all=0;
}a[310];

bool cmp(node x,node y)
{
    if(x.all!=y.all) return x.all>y.all;
    else if(x.ch>y.ch)return x.ch>y.ch;
    else return x.num<y.num;
}

int main()
{   
    cin>>n;
    for(int i=1;i<=n;i++)
    {   
        a[i].num=i;
        cin>>a[i].ch>>a[i].ma>>a[i].en;
        a[i].all=a[i].ch+a[i].ma+a[i].en;
    }

    sort(a+1,a+1+n,cmp);

    for(int i=1;i<=n;i++)
        cout<<a[i].num<<" "<<a[i].all<<endl;
    return 0;
}

0分，悬关求条