题解 | 最厉害的学生

#include <stdio.h>
#include<stdlib.h>
int cmp(const void*a,const void*b){
    return *(int*)b-*(int*)a;
}
int main() {
   int n;
  typedef struct{
    char name[10];
    int c1;
    int c2;
    int c3;
  }student;
  student class[1001];
  int sum[1001],sum0[1001];
  scanf("%d",&n);
  int i,j;
  for(i=0;i<n;i++){
    scanf("%s %d %d %d",class[i].name,&class[i].c1,&class[i].c2,&class[i].c3);
    sum[i]=class[i].c1+class[i].c2+class[i].c3;
    sum0[i]=class[i].c1+class[i].c2+class[i].c3;
  }
  qsort(sum,n,sizeof(int),cmp);
  for(i=0;i<n;i++){
    if(sum0[i]==sum[0])
    break;
  }
  printf("%s %d %d %d",class[i].name,class[i].c1,class[i].c2,class[i].c3);
    return 0;
}