View Code of Problem 82

#include<iostream>
#include<algorithm>
using namespace std;
typedef struct student{
	char id[20];
	char name[20];
	int a;
	int b;
	int c;
	
}Student;
bool cmp(Student a,Student b){
	
	return (a.a+a.b+a.c)>(b.a+b.b+b.c);
}
int main(){
	int n;
	scanf("%d",&n);
	int i;
	Student s[n];
	for(i=0;i<n;i++){
		scanf("%s %s %d %d %d",s[i].id,s[i].name,&s[i].a,&s[i].b,&s[i].c);
	}
	int suma=0,sumb=0,sumc=0;
	int avea,aveb,avec;
	for(i=0;i<n;i++){
		suma+=s[i].a;
		sumb+=s[i].b;
		sumc+=s[i].c;
	}
	avea=suma/n;
	aveb=sumb/n;
	avec=sumc/n;
	
	sort(s,s+n,cmp);
	printf("%d %d %d\n",avea,aveb,avec);
	printf("%s %s %d %d %d",s[0].id,s[0].name,s[0].a,s[0].b,s[0].c);
	
	return 0;
}