PAT1022 Digital Library

我的心愿是世界和平！

题目描述：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.
输入：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
输出：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 时若用 int ，输出时需要使用 printf("%07d",id) ，防止有 0000001 等输入出现。若使用 string ，则无需考虑。

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<utility>
#include<map>
using namespace std;

struct Books{
    int id;
    string title;
    string author;
    string key;
    string publisher;
    string year;
}book[10005];
int m,n;

bool cmp(Books a,Books b){
    return a.id<b.id;
}

int main(){
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>book[i].id;
        getchar();
        getline(cin,book[i].title);
        getline(cin,book[i].author);
        getline(cin,book[i].key);
        getline(cin,book[i].publisher);
        getline(cin,book[i].year);
    }
    sort(book,book+n,cmp);
    cin>>m;
    while(m--){
        int t;
        string s;
        cin>>t;
        getchar();
        getchar();
        getline(cin,s);
        cout<<t<<": "<<s<<endl;
        int flag=0;
        for(int i=0;i<n;i++){
            if(t==1&&book[i].title==s){
                flag++;
                printf("%07d\n",book[i].id);
            }else if(t==2&&book[i].author==s){
                flag++;
                printf("%07d\n",book[i].id);
            }else if(t==3){
                int len=book[i].key.length(),num=-1;
                for(int j=0;j<len;j++){
                    if(book[i].key[j]==s[num+1]){
                        num++;
                        if(num==s.length()-1&&(j==len-1||book[i].key[j+1]==' ')){
                            flag++;
                            printf("%07d\n",book[i].id);
                        }
                    }else{
                        num=-1;
                    }
                }
            }
            else if(t==4&&book[i].publisher==s){
                flag++;
                printf("%07d\n",book[i].id);
            }
            else if(t==5&&book[i].year==s){
                flag++;
                printf("%07d\n",book[i].id);
            }
        }
        if(flag==0){
            cout<<"Not Found"<<endl;
        }
    }
    return 0;
}