#include <bits/stdc++.h>
using namespace std;
struct cen{
char a[100];
int y;
int s;
int q;
int sum;
};
int cmp(cen a,cen b){ //结构体名称
return a.sum>b.sum;
}
int main(){
struct cen w[1002];
int n,i;
cin>>n;
for (i=0;i<n;i++){
cin>>w[i].a>>w[i].y>>w[i].s>>w[i].q;
w[i].sum=w[i].y+w[i].s+w[i].q;
}
sort(w,w+n,cmp);
cout<<w[0].a<<" "<<w[0].y<<" "<<w[0].s<<" "<<w[0].q;
return 0;
}
2020-11-17 洛谷 P5740 结构体排序
最新推荐文章于 2024-04-24 20:11:21 发布