题解 | 最厉害的学生

#include <iostream>
#include<cstring>
#include<vector>
using namespace std;
struct student{
    string name;
   int  c1, c2, c3;
};
int main() {
int N=0;
cin>>N;
student  stu[N];
int a=0;
    while (a<N) { // 注意 while 处理多个 case
      cin>>stu[a].name>>stu[a].c1>>stu[a].c2>>stu[a].c3;
a++;
    }
    int max=stu[0].c1+stu[0].c2+stu[0].c3;
    string maxx=stu[0].name;
    int index=0;
    for(int i=1;i<N;i++)
    {
        if((stu[i].c1+stu[i].c2+stu[i].c3)>max)
       { max=stu[i].c1+stu[i].c2+stu[i].c3;
       maxx=stu[i].name;index=i;}
    }
    cout<<maxx<<" "<<stu[index].c1<<" "<<stu[index].c2<<" "<<stu[index].c3;
    return 0;
}
// 64 位输出请用 printf("%lld")