题解 | 最厉害的学生

#include <iostream>
#include <bits/stdc++.h>
using namespace std;

struct Student {
    string name;
    int a;
    int b;
    int c;
    int sum;
};

int main() {
    int n;
    cin >> n;
    Student s[1000];
    Student best;
    int Sbest = 0;
    for(int i =0;i<n;i++)
    {
        cin >> s[i].name >> s[i].a >> s[i].b >> s[i].c;
        s[i].sum = s[i].a+s[i].b+s[i].c;
    }
    for(int i =0;i<n;i++)
    {
        if(s[i].sum > Sbest)
        {
            best.a=s[i].a;
            best.b=s[i].b;
            best.c=s[i].c;
            best.name=s[i].name;
            Sbest=s[i].sum;
        }
    }
    cout <<best.name<<" "<<best.a<<" "<<best.b<<" "<<best.c;
}
// 64 位输出请用 printf("%lld")