九十分求调
查看原帖
九十分求调
1319712
_Vistion_楼主2024/9/13 10:25
#include <bits/stdc++.h>
#define ll long long
using namespace std;
struct soulve{
	string s;
	ll y,d,m;
};
bool cmp(soulve a, soulve b){
	return a.y+a.d+a.m > b.y+b.d+b.m;
}
int main(){
    soulve vis[10001];
    ll n;
    cin>>n;
    for(int i=0; i<n; i++){
    	cin>>vis[i].s>>vis[i].y>>vis[i].d>>vis[i].m;
	}
	sort(vis, vis+n, cmp);
	cout<<vis[0].s<<" "<<vis[0].y<<" "<<vis[0].d<<" "<<vis[0].m;
	return 0;
}
2024/9/13 10:25
加载中...