View Code of Problem 82

#include<iostream>
#include<string>
#include<algorithm>
 
using namespace std;
 
struct Student {
	string number;
	string name;
	double score1;
	double score2;
	double score3;
	double averge;
};
 
Student s[1000];
 
bool compare(const Student s1, const Student s2) {
	return s1.averge > s2.averge;
}
 
int main() {
	int N;
	cin >> N;
	double averge1, averge2, averge3;
	averge1 = averge2 = averge3 = 0;
	for (int i = 0; i < N; ++i) {
		cin >> s[i].number >> s[i].name >> s[i].score1 >> s[i].score2 >> s[i].score3;
		s[i].averge = (s[i].score1 + s[i].score2 + s[i].score3) / 3;
		averge1 += s[i].score1;
		averge2 += s[i].score2;
		averge3 += s[i].score3;
	}
	averge1 /= N;
	averge2 /= N;
	averge3 /= N;
 
	cout << averge1 << " " << averge2 << " " << averge3 << endl;
	sort(s, s + N, compare);
	cout << s[0].number << " " << s[0].name << " " << s[0].score1 << " " << s[0].score2 << " " << s[0].score3;
}