pat甲级1012The Best Rank（C语言）

#include<stdio.h>
#include<stdlib.h>
struct Student{
    int id,best=0;//最好排名的下标
    int score[4];//四门课的成绩
    int rank[4];//四门课的排名
};
struct Student students[20000];
int compare0(const void*a,const void*b){
    Student* studentA=(Student*)a;
    Student* studentB=(Student*)b;
    return studentB->score[0]-studentA->score[0];
}
int compare1(const void*a,const void*b){
    Student* studentA=(Student*)a;
    Student* studentB=(Student*)b;
    return studentB->score[1]-studentA->score[1];
}
int compare2(const void*a,const void*b){
    Student* studentA=(Student*)a;
    Student* studentB=(Student*)b;
    return studentB->score[2]-studentA->score[2];
}
int compare3(const void*a,const void*b){
    Student* studentA=(Student*)a;
    Student* studentB=(Student*)b;
    return studentB->score[3]-studentA->score[3];
}
int main(){
    //又是结构体排序啊
    int n,m;scanf("%d %d",&n,&m);
    int idArr[20000];
    for(int i=0;i<n;i++){
        scanf("%d %d %d %d",&students[i].id,&students[i].score[1],&students[i].score[2],&students[i].score[3]);
        students[i].score[0]=(students[i].score[1]+students[i].score[2]+students[i].score[3])/3.0+0.5;
    }
    for(int i=0;i<m;i++){
        scanf("%d",&idArr[i]);
    }
    qsort(students,n,sizeof(Student),compare0);//先排平均
    for(int i=0;i<n;i++){            
        if(i!=0&&(students[i].score[0]==students[i-1].score[0])){
            //如果成绩相同
            students[i].rank[0]=students[i-1].rank[0];
        }else{
            students[i].rank[0]=i;
        }
    }
    qsort(students,n,sizeof(Student),compare1);
    for(int i=0;i<n;i++){
        if(i!=0&&(students[i].score[1]==students[i-1].score[1])){
            //如果成绩相同
            students[i].rank[1]=students[i-1].rank[1];
        }else{
            students[i].rank[1]=i;
        }
    }
    qsort(students,n,sizeof(Student),compare2);
    for(int i=0;i<n;i++){
        if(i!=0&&(students[i].score[2]==students[i-1].score[2])){
            //如果成绩相同
            students[i].rank[2]=students[i-1].rank[2];
        }else{
            students[i].rank[2]=i;
        }
    }
    qsort(students,n,sizeof(Student),compare3);
    for(int i=0;i<n;i++){
        if(i!=0&&(students[i].score[3]==students[i-1].score[3])){
            //如果成绩相同
            students[i].rank[3]=students[i-1].rank[3];
        }else{
            students[i].rank[3]=i;
        }
    }
    for(int i=0;i<n;i++){
        students[i].best=0;
        for(int j=1;j<4;j++){
            if(students[i].rank[j]<students[i].rank[students[i].best]){
                students[i].best=j;
            }
        }
    }
    char print[4]={'A','C','M','E'};
    bool isFind=false;
    for(int i=0;i<m;i++){
        isFind=false;
        for(int j=0;j<n;j++){
            if(idArr[i]==students[j].id){
                printf("%d %c\n",students[j].rank[students[j].best]+1,print[students[j].best]);
                isFind=true;
                break;
            }
        }
        if(!isFind){
            printf("N/A\n");
        }
    }
    return 0;
}