答案

#include<bits/stdc++.h>
using namespace std;struct cangyin{int a,b,c,sum,id;}a[301];int cmp(cangyin aa,cangyin bb){if(aa.sum!=bb.sum){return aa.sum>bb.sum;}else if(aa.sum==bb.sum&&aa.a!=bb.a){return aa.a>bb.a;}else if(aa.sum==bb.sum&&aa.a==bb.a){return aa.id<bb.id;}}int main(){int n;cin>>n;for(int i=0;i<n;i++){cin>>a[i].a>>a[i].b>>a[i].c;a[i].sum=a[i].a+a[i].b+a[i].c;a[i].id=i+1;}sort(a,a+n,cmp);for(int i=0;i<5;i++){cout<<a[i].id<<" "<<a[i].sum<<endl;}return 0;}