View Code of Problem 82

#include <iostream>
#include <cstdio>
using namespace std;
struct Stu{
    char number[999],name[999];
    int a,b,c;
}stu[999];
int main(){
    int n,sum[999],sum1=0,sum2=0,sum3=0,ave1,ave2,ave3,max=0,t=0;
    while(cin>>n&&n!=0){
    for(int i=0;i<n;i++){
        cin>>stu[i].number>>stu[i].name>>stu[i].a>>stu[i].b>>stu[i].c;
        sum1+=stu[i].a;
        sum2+=stu[i].b;
        sum3+=stu[i].c;
        sum[i]=stu[i].a+stu[i].b+stu[i].c;
        if(sum[i]>max){
            max=sum[i];
            t=i;
        }
    }
    ave1=sum1/n;
    ave2=sum2/n;
    ave3=sum3/n;
    cout<<ave1<<" "<<ave2<<" "<<ave3<<endl;
        cout<<stu[t].number<<" "<<stu[t].name<<" "<<stu[t].a<<" "<<stu[t].b<<" "<<stu[t].c<<endl;
    }
    return 0;
}