题解 | 最厉害的学生

#include <iostream>
using namespace std;
#include<vector>
#include<algorithm>
struct Student {
    string mname;
    int yuwen;
    int shuxue;
    int yingyu;
    int sumgrade;
};
class maxstu{
    public:
    bool operator()(Student s1,Student s2){
          return s1.sumgrade<s2.sumgrade;
    }
};

int main() {
    int N;
    cin >> N;
    vector<Student>v;
    while (N--) {
        string name;
        int yuwen;
        int shuxue;
        int yingyu;
        cin >> name >> yuwen >> shuxue >> yingyu;
        Student s;
        s.mname=name;
        s.yuwen=yuwen;
        s.shuxue=shuxue;
        s.yingyu=yingyu;
        s.sumgrade=yuwen+shuxue+yingyu;
        v.push_back(s);
    }
    auto pos= max_element(v.begin(),v.end(),maxstu());
      cout<<(*pos).mname<<" "<<(*pos).yuwen<<" "<<(*pos).shuxue<<" "<<(*pos).yingyu;

}
// 64 位输出请用 printf("%lld")