题解 | 最厉害的学生

#include <iostream>
#include <vector>
using namespace std;

struct student {
    string name;
    int c1, c2, c3;
    int total;
};

int main() {
    int n;
    cin >> n;
    vector<student> s(n);
    for (int i = 0; i < n; ++i) {
        cin >> s[i].name >> s[i].c1 >> s[i].c2 >> s[i].c3;
        s[i].total = s[i].c1 + s[i].c2 + s[i].c3;
    }

    int max_total = -1;
    int index = 0;
    for (int i = 0; i < n; ++i) {
        if (s[i].total > max_total) {
            max_total = s[i].total;
            index = i;
        }
    }

    cout << s[index].name << " " << s[index].c1 << " " << s[index].c2 << " " <<
         s[index].c3;

    return 0;
}