View Code of Problem 82

#include<iostream>
#include<math.h>
#include<algorithm>
#include<cstring>
using namespace std;
struct node{
	char id;
	char n[100];
	int a;
	int b;
	int c;
	int sum;
}s[1000];
bool cmp(node x,node y){
	return x.sum>y.sum;
}
int main(){
	int n,a1=0,a2=0,a3=0;
	cin>>n;
//	getchar();
	for(int i=0;i<n;i++){
		cin>>s[i].id>>s[i].n>>s[i].a>>s[i].b>>s[i].c;
		s[i].sum=s[i].a+s[i].b+s[i].c;
	}
	sort(s,s+n,cmp);
	for(int i=0;i<n;i++){
		
	a1+=s[i].a; 
	a2+=s[i].b;
	a3+=s[i].c;
			
	}
	cout<<a1/n<<" "<<a2/n<<" "<<a3/n<<endl;
	cout<<s[0].id<<" "<<s[0].n<<" "<<s[0].a<<" "<<s[0].b<<" "<<s[0].c<<endl;
	return 0;
}