1095 解码PAT准考证 (25 分)

//1095 解码PAT准考证 (25 分)
/*
第 1 位是级别，即 T 代表顶级；A 代表甲级；B 代表乙级；
第 2~4 位是考场编号，范围从 101 到 999；
第 5~10 位是考试日期，格式为年、月、日顺次各占 2 位；
最后 11~13 位是考生编号，范围从 000 到 999。
*/
#include <iostream>
#include <cstring>
#include <algorithm>
#include <map>
#include <vector>
using namespace std;
struct student{
    string id;
    int score;
};
struct examcase2{
    int allscore=0;
    int people=0;
};
struct examroom{
    string room;
    int people=0;
};
bool cmp(student a,student b)
{
    if(a.score!=b.score) return a.score>b.score;
    else return a.id<b.id;
}
bool cmp1(examroom a,examroom b)
{
    if(a.people!=b.people) return a.people>b.people;
    else return a.room<b.room;
}
int main()
{
    int N,M;
    scanf("%d %d",&N,&M);  
    map<string,vector<student>>  case1;     
    map<string,examcase2> case2;            
    map<string,map<string,examroom>>  case3;   
    for(int i = 0; i < N; i++)
    {
        student s;
        char id[14];
        scanf("%s %d",id,&s.score);
        s.id=id;
        string ranks=s.id.substr(0,1);
        string exroom=s.id.substr(1,3);
        string date=s.id.substr(4,6);
        case1[ranks].push_back(s);        
        case2[exroom].allscore+=s.score;    
        case2[exroom].people++;           
        case3[date][exroom].room=exroom;   
        case3[date][exroom].people++;
    }
    for(int i=1;i<=M;i++)
    {
        int classi;
        char request[7];
        memset(request,0,sizeof(request));
        scanf("%d %s",&classi,request);
        printf("Case %d: %d %s\n",i,classi,request);
        int flag=1;
        switch(classi)
        {
            case 1:
                {
                    vector<student>  ttt=case1[request];    
                    sort(ttt.begin(),ttt.end(),cmp);        
                    for(auto it=ttt.begin();it!=ttt.end();it++)
                    {
                        printf("%s %d\n",(*it).id.c_str(),(*it).score);
                        flag=0;                   
                    }
                    break;
                }
            case 2:
                {
                    examcase2 ttt=case2[request];       
                    if(ttt.people!=0)               
                    {
                        printf("%d %d\n",ttt.people,ttt.allscore);  
                        flag=0;
                    }
                    break;
                }
            case 3:
                {
                    map<string,examroom> ttt=case3[request]; 
                    int i=0,len=ttt.size();       
                    examroom e[len];
                    for(auto it=ttt.begin();it!=ttt.end();it++)
                    {
                        e[i++]=it->second;        
                    }
                    sort(e,e+len,cmp1);   
                    for(i=0;i<len;i++)
                    {
                        printf("%s %d\n",e[i].room.c_str(),e[i].people);
                        flag=0;
                    }
                    break;
                }
        }
        if(flag)  printf("NA\n");    
    }
    return 0;
}

struct student{
    string id;
    int score;
};

struct examcase2{
    int allscore=0;
    int people=0;
};

struct examroom{
    string room;
    int people=0;
};

    map<string,vector<student>>  case1;     //按等级分；
    map<string,examcase2> case2;             //按教室分；
    map<string,map<string,examroom>>  case3;     //按日期分；

        string ranks=s.id.substr(0,1);
        string exroom=s.id.substr(1,3);
        string date=s.id.substr(4,6);

for(auto it=ttt.begin();it!=ttt.end();it++){
        printf("%s %d\n",(*it).id.c_str(),(*it).score);
        flag=0; 
}