View Code of Problem 82

#include <iostream>
#include <algorithm>
#include <string>
using namespace std; 
typedef struct {
	char num;
	string name;
	int p1;
	int p2;
	int p3;
}student;
int main(){
	int n;
	cin>>n;
	student s[n]={0};
	double a1=0,a2=0,a3=0;
	int max=0;
	for(int i=0;i<n;i++){
		cin>>s[i].num>>s[i].name>>s[i].p1>>s[i].p2>>s[i].p3;
		a1=a1+s[i].p1;
		a2=a2+s[i].p2;
		a3=a3+s[i].p3;
		if((s[i].p1+s[i].p2+s[i].p3)>(s[max].p1+s[max].p2+s[max].p3))
			max=i;
	}
	a1=1.0*a1/n;
	a2=1.0*a2/n;
	a3=1.0*a3/n;
	cout<<a1<<" "<<a2<<" "<<a3<<endl;
	cout<<s[max].num<<" "<<s[max].name<<" "<<s[max].p1<<" "<<s[max].p2<<" "<<s[max].p3;
	
	
}