View Code of Problem 82

#include<stdio.h>
#include<string.h>
struct cj{
	char no[10];
	char name[10];
	double a;
	double b;
	double c;
};
int main(){
	int i,n,max;
	double sum1,sum2,sum3,pa,pb,pc,d[10]={0};
	struct cj s[10];
	scanf("%d",&n);
	for(sum1=sum2=sum3=i=0;i<n;i++)
	{
		scanf("%s%s%lf%lf%lf",&s[i].no,&s[i].name,&s[i].a,&s[i].b,&s[i].c);
		sum1+=s[i].a;
		sum2+=s[i].b;
		sum3+=s[i].c;
		d[i]=s[i].a+s[i].b+s[i].c;
	}
	pa=sum1/n;
	pb=sum2/n;
	pc=sum3/n;  
	
	for(max=i=0;i<n;i++)
		if(d[i]>d[max])
			max=i;
	printf("%0.0f %0.0f %0.0f\n",pa,pb,pc);
	printf("%s %s %0.0f %0.0f %0.0f\n",s[max].no,s[max].name,s[max].a,s[max].b,s[max].c);
return 0;	
}