View Code of Problem 82

#include<stdio.h>
struct student
{
	int num;
	char name[100];
	int	s1;
	int s2;
	int s3;
	int sum;
};

int main(){
	
	int i,n;
	int sum1=0,sum2=0,sum3=0;
	scanf("%d",&n);
	struct student stu[n+1];
	for(i=1;i<=n;i++){
		scanf("%s %s %d %d %d",&stu[i].num,&stu[i].name,&stu[i].s1,&stu[i].s2,&stu[i].s3);
		sum1+=stu[i].s1;
		sum2+=stu[i].s2;
		sum3+=stu[i].s3;
		stu[i].sum=stu[i].s1+stu[i].s2+stu[i].s3;
	}
	
	int max=0,max_id=0;
	for(i=1;i<=n;i++){
		if(stu[i].sum>max){
			max=stu[i].sum;
			max_id=i;
		}
	}
	printf("%d %d %d\n",sum1/n,sum2/n,sum3/n);
	printf("%d %s %d %d %d",max_id,stu[max_id].name,stu[max_id].s1,stu[max_id].s2,stu[max_id].s3);
	//输出总分最高的学生 的分数 
	return 0;
}