1095 解码PAT准考证 (25 分)

辣鸡的未AC代码：

#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;

typedef struct{
    char all[15];
    int room,day,num;
    char type;
    int sco;
}stu;

typedef struct{
    int ad,ns;
}address;

bool cmp1(stu a,stu b){
    if(a.all[0]<b.all[0])
        return 1;
    else if(a.all[0]==b.all[0]&&a.sco>b.sco){
        return 1;
    }
    else if(a.all[0]==b.all[0]&&a.sco==b.sco&&strcmp(a.all,b.all)<0)
        return 1;
    return 0;
}

bool cmp2(stu a,stu b){
    if(a.day<b.day)
        return 1;
    else if(a.day==b.day&&a.room<b.room){
        return 1;
    }
    return 0;
}

bool cmp3(address a,address b){
    if(a.ns>b.ns)
        return 1;
    else if(a.ns==b.ns&&a.ad<b.ad){
        return 1;
    }
    return 0;
}

int main(){
    int n,m;
    cin>>n>>m;
    stu a[10005];
    char in[20];
    for(int i=0;i<n;i++){
        scanf("%s %d",a[i].all,&a[i].sco);
        a[i].type=a[i].all[0];
        memset(in,0,sizeof in);
        strncpy(in,a[i].all+1,3);
        a[i].room=atoi(in);
        memset(in,0,sizeof in);
        strncpy(in,a[i].all+4,6);
        a[i].day=atoi(in);
        memset(in,0,sizeof in);
        strncpy(in,a[i].all+10,3);
        a[i].num=atoi(in);
        //cout<<a[i].type<<" "<<a[i].room<<" "<<a[i].day<<" "<<a[i].num<<" "<<endl;
    }
    int t;
    for(int i=1;i<=m;i++){
        scanf("%d",&t);
        printf("Case %d: %d ",i,t);
        if(t==1){
            char x;
            int f=0;
            cin>>x;
            cout<<x<<endl;
            sort(a,a+n,cmp1);
            for(int j=0;j<n;j++){
                if(a[j].all[0]==x){
                    f=1;
                    printf("%s %d\n",a[j].all,a[j].sco);
                }
            }
            if(f==0)
                printf("NA\n");
        }
        else if(t==2){
            char in[20];
            scanf("%s",in);
            printf("%s\n",in);
            int add=atoi(in);
            int k=0,sum=0;
            for(int j=0;j<n;j++){
                if(a[j].room==add){
                    k++;
                    sum+=a[j].sco;
                }
            }
            if(k>0)
                cout<<k<<" "<<sum<<endl;
            else
                printf("NA\n");
        }
        else if(t==3){
            char in[20];
            scanf("%s",in);
            printf("%s\n",in);
            int x=atoi(in);
            sort(a,a+n,cmp2);
            int k=1;
            address b[105];
            int v=0;
            for(int j=0;j<n;j++){
                if(a[j].day==x){
                    if(a[j].room==a[j+1].room){
                        k++;
                    }
                    else if(a[j].room>=101&&a[j].room<=999){
                        //cout<<a[j].room<<" "<<k<<endl;
                        b[v].ad=a[j].room;
                        b[v].ns=k;
                        k=1;
                        v++;
                    }
                }
            }
            if(v>0){
                sort(b,b+v,cmp3);
                for(int j=0;j<v;j++)
                    printf("%03d %d\n",b[j].ad,b[j].ns);
            }
            else
                printf("NA\n");
        }
        else{
            char in[20];
            scanf("%s",in);
            printf("%s\n",in);
            printf("NA\n");
        }
    }

    return 0;
}