View Code of Problem 82

#include<cstdlib>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
struct node
{
     char d[30],e[30];
	int a,b,c;
}s[200];
int cmp(node a, node b)
{
		return a.a+a.b+a.c>b.a+b.b+b.c;
}
int main(){
	int n;
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{
		scanf("%s%s%d%d%d",s[i].e,s[i].d,&s[i].a,&s[i].b,&s[i].c);
	}
	int sum1=0,sum2=0,sum3=0;
	for(int j=0;j<n;j++)
	{
		sum1+=s[j].a;
		sum2+=s[j].b;
		sum3+=s[j].c;
	}
	printf("%d %d %d\n",sum1/n,sum2/n,sum3/n);
	sort(s,s+n,cmp);
	printf("%s %s %d %d %d\n",s[0].e,s[0].d,s[0].a,s[0].b,s[0].c);
	return 0;
}