PAT Advanced—1022 Digital Library (30分)

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 (≤10​4​​) 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.

题目大意：输入书的信息，然后分别根据书名，作者，关键词，出版社，年份，来查找书的id

思路：
  很明显要用map来做查找，将要查找的值作为键，书号为值，一个键可能对应多个值，又书号不重复，所以可以用set来存放值

注意：

1. set的默认遍历是升序的
2. 输入信息的时候，可以scanf，cin，getline，getchar搭配使用，特别注意空格，换行符的擦除
3. c++的字符串不能直接用scanf和printf

代码：(C++)

#include<iostream>
#include<map>
#include<set>

using namespace std;

//书名
map<string,set<int> > title, author, keyword, publisher, year;

void query(map<string,set<int> > &m, string &q)
{
	if(m.find(q) != m.end())
	{
		//set遍历默认为升序
		for(set<int>::iterator it=m[q].begin(); it!=m[q].end(); it++)
		{
			printf("%07d\n",*it);
		}
	}
	else
		cout<<"Not Found\n";
}

int main()
{
	int n;
	scanf("%d",&n);
	int bookId;
	for(int i=0; i<n; i++)
	{
		string ti,au,key,pub,ye;
		// \n去换行
  		scanf("%d\n",&bookId);
  		getline(cin,ti);
  		title[ti].insert(bookId);
		getline(cin,au);
		author[au].insert(bookId);
		while(cin>>key)
		{
			keyword[key].insert(bookId);
			char c = getchar();
			if(c == '\n')
				break;
		}
		getline(cin,pub);
		publisher[pub].insert(bookId);
		getline(cin,ye);
		year[ye].insert(bookId);
	}
	cin>>n;
	int id;
	string str;
	for(int i=0; i<n; i++)
	{
		//用scanf标准输入,scanf不能直接c++string
		scanf("%d: ",&id);
		getline(cin,str);
		cout<<id<<": "<<str<<endl;
		switch(id)
		{
			case 1:query(title,str);break;
			case 2:query(author,str);break;
			case 3:query(keyword,str);break;
			case 4:query(publisher,str);break;
			case 5:query(year,str);break;
		}
	}
	return 0;
}

参考：
  https://www.liuchuo.net/archives/2295