PAT1153Decode Registration Card of PAT

A registration card number of PAT consists of 4 parts:

the 1st letter represents the test level, namely, T for the top level, A for advance and B for basic;
the 2nd - 4th digits are the test site number, ranged from 101 to 999;
the 5th - 10th digits give the test date, in the form of yymmdd;
finally the 11th - 13th digits are the testee’s number, ranged from 000 to 999.
Now given a set of registration card numbers and the scores of the card owners, you are supposed to output the various statistics according to the given queries.

Input Specification:
Each input file contains one test case. For each case, the first line gives two positive integers N (≤10
​4
​​ ) and M (≤100), the numbers of cards and the queries, respectively.

Then N lines follow, each gives a card number and the owner’s score (integer in [0,100]), separated by a space.

After the info of testees, there are M lines, each gives a query in the format Type Term, where

Type being 1 means to output all the testees on a given level, in non-increasing order of their scores. The corresponding Term will be the letter which specifies the level;
Type being 2 means to output the total number of testees together with their total scores in a given site. The corresponding Term will then be the site number;
Type being 3 means to output the total number of testees of every site for a given test date. The corresponding Term will then be the date, given in the same format as in the registration card.
Output Specification:
For each query, first print in a line Case #: input, where # is the index of the query case, starting from 1; and input is a copy of the corresponding input query. Then output as requested:

for a type 1 query, the output format is the same as in input, that is, CardNumber Score. If there is a tie of the scores, output in increasing alphabetical order of their card numbers (uniqueness of the card numbers is guaranteed);
for a type 2 query, output in the format Nt Ns where Nt is the total number of testees and Ns is their total score;
for a type 3 query, output in the format Site Nt where Site is the site number and Nt is the total number of testees at Site. The output must be in non-increasing order of Nt’s, or in increasing order of site numbers if there is a tie of Nt.
If the result of a query is empty, simply print NA.

Sample Input:
8 4
B123180908127 99
B102180908003 86
A112180318002 98
T107150310127 62
A107180908108 100
T123180908010 78
B112160918035 88
A107180908021 98
1 A
2 107
3 180908
2 999

Sample Output:
Case 1: 1 A
A107180908108 100
A107180908021 98
A112180318002 98
Case 2: 2 107
3 260
Case 3: 3 180908
107 2
123 2
102 1
Case 4: 2 999
NA

代码如下：（本人参考其他大佬的代码编写而成，可能去其他大佬代码相似）
#include
#include
#include<stdio.h>
#include
#include<unordered_map>
#include
using namespace std;
struct card{
string cardnumber;
string level;
int site, date, number;
int score;
};
card c[10001];
bool cmp(card a, card b){
if(a.score!=b.score){
return a.score > b.score;
}
else
return a.cardnumber < b.cardnumber;
}
bool cmp2(pair<int,int> p1, pair<int,int> p2){
if(p1.second!=p2.second){
return p1.second > p2.second;
}
else
return p1.first < p2.first;
}
int main(){
int n, m;
cin>>n>>m;
for(int i = 0;i < n;i++){
cin>>c[i].cardnumber>>c[i].score;
c[i].level = c[i].cardnumber.substr(0,1);
c[i].site = stoi(c[i].cardnumber.substr(1,3));
c[i].date = stoi(c[i].cardnumber.substr(4,6));
c[i].number = stoi(c[i].cardnumber.substr(10,13));
}
int type;
string k;
sort(c,c+n,cmp);
for(int i = 1;i <= m;i++){
cin>>type>>k;
cout<<“Case “<<i<<”: “<<type<<” “<<k<<endl;
if(type==1){
bool flag = false;
for(int i = 0;i < n;i++){
if(k == c[i].level){
printf(”%s %d\n”, c[i].cardnumber.c_str(), c[i].score);
flag = true;
}
}
if(!flag) puts(“NA”);
}
else if(type == 2){
int nt = 0;
int ns = 0;
int key = stoi(k);
for(int i = 0;i < n;i++){
if(key == c[i].site){
nt++;
ns += c[i].score;
}
}
if(nt > 0)
cout<<nt<<" “<<ns<<endl;
else
puts(“NA”);
}
else if(type == 3){
unordered_map<int,int>mp;
int key = stoi(k);
for(int i = 0;i < n;i++){
if(key == c[i].date){
mp[c[i].site]++;
}
}
if(mp.size() == 0)
puts(“NA”);
else{
vector<pair<int, int>>vec(mp.begin(),mp.end());
sort(vec.begin(),vec.end(), cmp2);
for(int i = 0;i < vec.size();i++){
printf(”%03d %d\n", vec[i].first,vec[i].second);
}
}
}
}
return 0;
}