PAT A1022. 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 (<=10000) which is the total number of books. Then N blocks follow, each contains the information of a book in 6 lines:

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:

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.

31111111The Testing BookYue Chentest code debug sort keywordsZUCS Print20113333333Another Testing BookYue Chentest code sort keywordsZUCS Print220122222222The Testing BookCYLLkeywords debug bookZUCS Print2201161: The Testing Book2: Yue Chen3: keywords4: ZUCS Print5: 20113: blablablaSample Output:
1: The Testing Book111111122222222: Yue Chen111111133333333: keywords1111111222222233333334: ZUCS Print11111115: 2011111111122222223: blablablaNot Found
#include <cstdio>#include <iostream>#include <algorithm>#include <cstring>#include <string>#include <map>#include <set>#define Max 100001using namespace std;map<string ,set<int> >S;struct Book{		string Title;	string Author;	string Key;	string Publisher;	string Year;}B[Max];int main(){	int n,m;int Id;	scanf("%d",&n);	for(int i=0;i<n;i++)	{		scanf("%d",&Id);		char b=getchar();		getline(cin,B[i].Title);		S[B[i].Title].insert(Id);		getline(cin,B[i].Author);		S[B[i].Author].insert(Id);		while(cin>>B[i].Key)		{		    S[B[i].Key].insert(Id);			char a;			a=getchar();			if(a=='/n')				break;		}		getline(cin,B[i].Publisher);		S[B[i].Publisher].insert(Id);		getline(cin,B[i].Year);		S[B[i].Year].insert(Id);	 	}	scanf("%d",&m);	for(int i=0;i<m;i++)	{		int k;		string im;		scanf("%d: ",&k);		getline(cin,im);		cout<<k<<": "<<im<<endl;		if(S.find(im)!=S.end())		{			for(set<int>::iterator it=S[im].begin();it!=S[im].end();it++)			{				printf("%07d/n",*it);			}		}		else printf("Not Found/n");	}	system("pause");	return 0;}