类似1050题可解

解题思路:

注意事项:部分地方还可以更精简

参考代码:

#include <stdio.h>

#include <stdlib.h>

typedef struct {

char name[10];

char number[10];

int grade[3];

} STUDENT;

int main() {

int i, N, avggrade1 = 0, avggrade2 = 0, avggrade3 = 0;

scanf("%d", &N);

getchar();

STUDENT* students = (STUDENT*)malloc(N * sizeof(STUDENT));

for (i = 0; i < N; i++) {

scanf("%s%s%d%d%d", students[i].number, students[i].name, &(students[i].grade[0]), &(students[i].grade[1]), &(students[i].grade[2]));

getchar();

}

for (i = 0; i < N; i++)avggrade1 += students[i].grade[0];

avggrade1 /= N;

for (i = 0; i < N; i++)avggrade2 += students[i].grade[1];

avggrade2 /= N;

for (i = 0; i < N; i++)avggrade3 += students[i].grade[2];

avggrade3 /= N;

printf("%d %d %d\n", avggrade1, avggrade2, avggrade3);

int* sumgrade = (int*)malloc(N * sizeof(int));

for (i = 0; i < N; i++)sumgrade[i] = students[i].grade[0] + students[i].grade[1] + students[i].grade[2];

int max_index = 0;

for (i = 0; i < N; i++) {

if (sumgrade[i] > sumgrade[max_index])max_index = i;

}

printf("%s %s %d %d %d", students[max_index].number, students[max_index].name, students[max_index].grade[0], students[max_index].grade[1], students[max_index].grade[2]);

free(students);

return 0;

}