结构体之成绩统计2

解题思路:

注意事项:

参考代码:

#include<stdio.h>

#include<stdlib.h>

typedef struct stu

{

char num[20];

char name[20];

int chinese;

int math;

int english;

}chengji;

int main()

{

chengji q[20];

int sum[20]={0},n,i,max,ave1=0,ave2=0,ave3=0,flag=0;

scanf("%d",&n);

for(i=0;i<n;i++)

{

scanf("%s%s%d%d%d",&q[i].num,&q[i].name,&q[i].chinese,&q[i].math,&q[i].english);

sum[i]=q[i].chinese+q[i].math+q[i].english;

ave1+=q[i].chinese;

ave2+=q[i].math;

ave3+=q[i].english;

}

printf("%d %d %d\n",ave1/n,ave2/n,ave3/n);

max=sum[0];

for(i=0;i<n;i++)

{

if(sum[i]>max)

{

max=sum[i];

flag=i;

}

}

printf("%s %s %d %d %d",q[flag].num,q[flag].name,q[flag].chinese,q[flag].math,q[flag].english);

}