本文详细介绍了PAT甲级竞赛中的1153题，该题涉及数据结构和排序算法。题目要求根据给定的注册卡号和分数，对不同级别、站点和日期的考试者进行统计和查询。文章讨论了题目的难点，如准考证号码包含字母、排序需求以及不同类型查询的处理，并提供了代码注释和满分解决方案。重点在于使用结构体存储数据并自定义排序函数，以及在处理查询3时，利用unordered_map提高效率。
题目
A registration card number of PAT consists of 4 parts:
- the 1st letter represents the test level, namely,
Tfor the top level,Afor advance andBfor 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 (≤104) and M (≤100), the numbers of cards and the queries, respectively.
Then N lines follow, eac
最低0.47元/天 解锁文章
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
