View Code of Problem 82

#include<stdio.h> 
int findMax(int arr[], int N) {
	int t=0, k;
	for(int i=0; i<N; i++) {
		if(arr[i]>t) {
			t=arr[i];
			k=i;
		}
	}
	return k;
}
int main() {
	int N,a[100],b[100],c[100], sum1=0,sum2=0,sum3=0,k,sum[100];
	scanf("%d", &N);
	char c1[100][100], c2[100][100];
	for(int i=0; i<N; i++) {
		scanf("%s %s %d %d %d", &c1[i], &c2[i], &a[i], &b[i], &c[i]);
		sum1+=a[i];
		sum2+=b[i];
		sum3+=c[i];
		sum[i]=a[i]+b[i]+c[i];
	}
	printf("%d %d %d\n", sum1/N, sum2/N, sum3/N);
	k=findMax(sum,N);	
	printf("%s %s %d %d %d", c1[k],c2[k],a[k],b[k],c[k]);	
}