//
// Created by Sween'e'y on 2022/8/16.
//
//P5740 【深基7.例9】最厉害的学生
#include <iostream>
#include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <deque>
#include <array>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <cmath>
#include <cstdio>
#include <climits>
#include <string>
#include <cstring>
#include <cctype>
#include <cassert>
using namespace std;
const double PI = acos(-1);
struct student {
string name;
int chiense;
int math;
int english;
int sum = 0;//总成绩
};
student arr[1005];//储存每个学生
int main() {
int n, max = 0, index;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
cin >> arr[i].name;
scanf("%d%d%d", &arr[i].chiense, &arr[i].math, &arr[i].english);
arr[i].sum = arr[i].chiense + arr[i].math + arr[i].english;
}
for (int i = 0; i < n; i++) {
if (arr[i].sum > max) { //之后更大的不会再选择了
max = arr[i].sum;
index = i;//记录最大下标
}
}
cout << arr[index].name << " ";
printf("%d %d %d", arr[index].chiense, arr[index].math, arr[index].english);
return 0;
}
P5740 【深基7.例9】最厉害的学生
最新推荐文章于 2023-02-07 19:41:13 发布