View Code of Problem 82

#include<stdio.h>
typedef struct student
{
	char num[10];
	char name[20];
	double s1;
	double s2;
	double s3;
}student;
int main()
{
	student stu[100];
	int i,j,max_num=0;
	int n;
	double sum[100],s1=0.0,s2=0.0,s3=0.0;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%s %s %lf%lf%lf",stu[i].num,stu[i].name,&stu[i].s1,&stu[i].s2,&stu[i].s3);
		sum[i] = stu[i].s1+stu[i].s2+stu[i].s3; 
		s1 += stu[i].s1;
		s2 += stu[i].s2;
		s3 += stu[i].s3;
	}
    double aver1,aver2,aver3;
    aver1 = s1/n;
    aver2 = s2/n;
    aver3 = s3/n;
    printf("%.0f %.0f %.0f\n",aver1,aver2,aver3);
    for(i=1;i<n;i++)
    {
    	if(sum[i]>=sum[max_num])
    	{
    		max_num = i;
		}
	}
	printf("%s %s %.0f %.0f %.0f",stu[max_num].num,stu[max_num].name,stu[max_num].s1,stu[max_num].s2,stu[max_num].s3);
	return 0;
}