PAT乙级 1085 PAT单位排行 (25 分) C语言

一、题目

二、源代码

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
struct Exam
{
    char id[7],name[7];
    int score;
};
struct School
{
    char name[7];
    int b,a,t,score,stu;
};
int cmp1(const void* a,const void* b)
{
    struct Exam *c=(struct Exam*)a;
    struct Exam *d=(struct Exam*)b;
    return strcmp(c->name,d->name);
}
int cmp2(const void* a,const void* b)
{
    struct School *c=(struct School*)a;
    struct School *d=(struct School*)b;
    if(c->score!=d->score)return d->score - c->score;
    if(c->stu!=d->stu)return c->stu - d->stu;
    return strcmp(c->name,d->name);
}
void lower(char name[])
{
    for(int i=0;i<strlen(name);i++)
    {
        if(name[i]>='A'&&name[i]<='Z')name[i]+=32;
    }
}
int main()
{
    int n,i,j,score,count=0;
    struct Exam s[100000];
    struct School p[100000];
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
        scanf("%s %d %s",s[i].id,&s[i].score,s[i].name);
        lower(s[i].name);
    }
    qsort(s,n,sizeof(struct Exam),cmp1);
    
    for(i=0;i<n;i++)
    {
        if(i==0)
        {
            p[0].b=p[0].a=p[0].t=0;
            p[0].stu=1;
            strcpy(p[0].name,s[0].name);
            if(s[0].id[0]=='B')p[0].b=s[0].score;
            else if(s[0].id[0]=='A')p[0].a=s[0].score;
            else p[0].t=s[0].score;
            count++;
        }
        else
        {
            if(strcmp(p[count-1].name,s[i].name)==0)
            {
                p[count-1].stu++;
                if(s[i].id[0]=='B')p[count-1].b+=s[i].score;
                else if(s[i].id[0]=='A')p[count-1].a+=s[i].score;
                else p[count-1].t+=s[i].score;
            }
            else
            {
                p[count-1].score=(int)((double)p[count-1].b/1.5+p[count-1].a+(double)p[count-1].t*1.5);
                p[count].b=p[count].a=p[count].t=0;
                p[count].stu=1;
                strcpy(p[count].name,s[i].name);
                if(s[i].id[0]=='B')p[count].b=s[i].score;
                else if(s[i].id[0]=='A')p[count].a=s[i].score;
                else p[count].t=s[i].score;
                count++;
            }
        }
    }
    p[count-1].score=(int)((double)p[count-1].b/1.5+p[count-1].a+(double)p[count-1].t*1.5);
    qsort(p,count,sizeof(struct School),cmp2);
    printf("%d\n",count);
    for(i=0,j=1,score=p[0].score;i<count;i++)
    {
        if(score!=p[i].score)
        {
            score=p[i].score;
            j=i+1;
        }
        printf("%d %s %d %d\n",j,p[i].name,p[i].score,p[i].stu);
    }
    return 0;
}

三、运行结果