PAT甲级真题 1022 Digital Library (30分) C++实现（建立结构体数组，注意测试点3、4的坑）-CSDN博客

本文链接：https://blog.csdn.net/zhang35/article/details/104206068

博客介绍了PAT甲级编程题1022——Digital Library的解题思路和C++实现。文章通过结构体数组存储书籍信息，并给出关键代码。特别提醒，在处理ID时，应使用字符串存储以通过测试点3和4。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目

A Digital Library contains millions of books, stored according to their titles, authors, key words of their abstracts, publishers, and published years. Each book is assigned an unique 7-digit number as its ID. Given any query from a reader, you are supposed to output the resulting books, sorted in increasing order of their ID’s.
Input Specification:
Each input file contains one test case. For each case, the first line contains a positive integer N (<=10000) which is the total number of books. Then N blocks follow, each contains the information of a book in 6 lines:
Line #1: the 7-digit ID number;
Line #2: the book title — a string of no more than 80 characters;
Line #3: the author — a string of no more than 80 characters;
Line #4: the key words — each word is a string of no more than 10 characters without any white space, and the keywords are separated by exactly one space;
Line #5: the publisher — a string of no more than 80 characters;
Line #6: the published year — a 4-digit number which is in the range [1000, 3000].
It is assumed that each book belongs to one author only, and contains no more than 5 key words; there are no more than 1000 distinct key words in total; and there are no more than 1000 distinct publishers.
After the book information, there is a line containing a positive integer M (<=1000) which is the number of user’s search queries. Then M lines follow, each in one of the formats shown below:
1: a book title
2: name of an author
3: a key word
4: name of a publisher
5: a 4-digit number representing the year
Output Specification:
For each query, first print the original query in a line, then output the resulting book ID’s in increasing order, each occupying a line. If no book is found, print “Not Found” instead.
Sample Input:
3
1111111
The Testing Book
Yue Chen
test code debug sort keywords
ZUCS Print
2011
3333333
Another Testing Book
Yue Chen
test code sort keywords
ZUCS Print2
2012
2222222
The Testing Book
CYLL
keywords debug book
ZUCS Print2
2011
6
1: The Testing Book
2: Yue Chen
3: keywords
4: ZUCS Print
5: 2011
3: blablabla
Sample Output:
1: The Testing Book
1111111
2222222
2: Yue Chen
1111111
3333333
3: keywords
1111111
2222222
3333333
4: ZUCS Print
1111111
5: 2011
1111111
2222222
3: blablabla
Not Found

思路

建立图书信息结构体数组。

读带空格的一行字符串时用getline(cin, s)；cin后、getline前，要有一个getchar()吸收换行符。

读入的keywords用stringstream拆分字符串，存储到set里：

        stringstream ss(keywords);
        string temp;
        while (ss >> temp){
   
            B[i].keywords.insert(temp);
        }

将图书数组按id排序，每次查询时，顺序遍历结构体数组，有符合条件的输出其id即可。

大神代码

柳神没有建立结构体数组，直接用map建立了各类信息到id集合（用set能去重且自动升序排列）的映射：

map<string, set<int> > title, author, key, pub, year;

另外，本文读用户查询信息如1: The Testing Book时，用了两个getchar()吸收:和空格，柳神用的方法比较简洁࿰