90大佬求改,必关
查看原帖
90大佬求改,必关
1328150
dq_088楼主2024/12/15 20:31
#include <bits/stdc++.h>
using namespace std;
const int maxn =1000; 
struct node{
	string name;
	int score1,score2,score3;
}a[maxn];
bool cmp(node c,node b)
{
	return c.score1+c.score2+c.score3>b.score1+b.score2+b.score3;
 } 
int main() {
	
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i].name>>a[i].score1>>a[i].score2>>a[i].score3;
		
		if(a[i].score1+a[i].score2+a[i].score3==0)
		{
				cout<<a[i].name<<" "<<a[i].score1<<" "<<a[i].score2<<" "<<a[i].score3;
			return 0;
		}
		
	}
	
	sort(a+1,a+1+n,cmp);
	cout<<a[1].name<<" "<<a[1].score1<<" "<<a[1].score2<<" "<<a[1].score3;
} 
2024/12/15 20:31
加载中...