#include #include #include #include using namespace std;

struct Student { string name; int math; int chinese; int english; int geography; int total; };

bool compare(Student s1, Student s2) { return s1.total > s2.total; }

int main() { int N; cin >> N; vector students(N); for (int i = 0; i < N; i++) { cin >> students[i].name; cin >> students[i].math >> students[i].chinese >> students[i].english >> students[i].geography; students[i].total = students[i].math + students[i].chinese + students[i].english + students[i].geography; }

sort(students.begin(), students.end(), compare);

for (int i = 0; i < N; i++) {
    cout << students[i].total << endl;
}
cout << students[0].name << endl;
int highest = max({students[0].math, students[0].chinese, students[0].english, students[0].geography});
int lowest = min({students[0].math, students[0].chinese, students[0].english, students[0].geography});
cout << highest << " " << lowest << endl;

return 0;

}


原文地址: http://www.cveoy.top/t/topic/pFsW 著作权归作者所有。请勿转载和采集!

免费AI点我,无需注册和登录