View Code of Problem 82

#include <stdio.h>
#include <string.h>
#include <math.h>
#define N 100
typedef struct st
{
	char xh[N];
	char name[N];
	int xk1;
	int xk2;
	int xk3;
};


int main()
{
	struct st xs[N];
	int n;
	int i;
	int k=0;
	int xk1 = 0, xk2 = 0, xk3 = 0, max = 0;
	scanf("%d", &n);
	for (i = 0; i < n; i++)
	{
		scanf("%s%s%d%d%d", &xs[i].xh, &xs[i].name, &xs[i].xk1, &xs[i].xk2, &xs[i].xk3);
		xk1 += xs[i].xk1;
		xk2 += xs[i].xk2;
		xk3 += xs[i].xk3;
	}
	printf("%d %d %d\n",xk1/n,xk2/n,xk3/n);
	for (i = 0; i < n; i++)
	{
	
		if((xs[i].xk1+xs[i].xk2+xs[i].xk3)>(xs[k].xk1+xs[k].xk2+xs[k].xk3))
		{
			max=i;
			k=max;
		}	
	}
	printf("%s %s %d %d %d\n",xs[max].xh, xs[max].name,xs[max].xk1,xs[max].xk2,xs[max].xk3);
}