题解 | 最厉害的学生

#include <stdio.h>
#include<stdlib.h>
int main() {
    int n=0;
    int j=0;
    scanf("%d",&n);
    struct std{
        char arr[9];
        int c1;
        int c2;
        int c3;
    }b,*a = (struct std*)malloc(n * sizeof(struct std));
    for(int i=0;i<n;i++)
    {
        scanf("%s %d %d %d",&a[i].arr,&a[i].c1,&a[i].c2,&a[i].c3);
    }
    int max=0;
    for(int i=0;i<n;i++)
    {
        
        if(((a[i].c1)+(a[i].c2)+(a[i].c3))>max)
        {
            j=i;
            max=((a[i].c1)+(a[i].c2)+(a[i].c3));
            b.c1=a[i].c1;
            b.c2=a[i].c2;
            b.c3=a[i].c3;
        }
        
    }
    printf("%s %d %d %d",a[j].arr,b.c1,b.c2,b.c3);
    free(a);
    return 0;
}