View Code of Problem 82

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<malloc.h>
#include<string.h>

struct stu {
	char nu[20];
	char name[20];
	int s1;
	int s2;
	int s3;
};

int main() {
	int n;
	scanf("%d", &n);
	struct stu *s = (struct stu *)malloc(n * sizeof(struct stu));

	for (int i = 0;i < n;i++) {
		scanf("%s%s%d%d%d", s[i].nu, s[i].name, &s[i].s1, &s[i].s2, &s[i].s3);
	}
	int av1=0, av2=0, av3=0;
	int max = 0, maxi = 0;
	for (int i = 0;i < n;i++) {
		av1 = av1 + s[i].s1;
		av2 = av2 + s[i].s2;
		av3 = av3 + s[i].s3;
		int sum = s[i].s1 + s[i].s2 + s[i].s3;
		if (sum > max) {
			max = sum;
			maxi = i;
		}
	}
	av1 = av1 / n;av2 = av2/n;av3 = av3 / n;
	printf("%d %d %d\n", av1, av2, av3);
	printf("%s %s %d %d %d\n", s[maxi].nu, s[maxi].name, s[maxi].s1, s[maxi].s2, s[maxi].s3);


}

Double click to view unformatted code.


Back to problem 82