pat 1022 digital library

 #include <iostream>
 #include <sstream>
 #include <string>
 #include <vector>
 #include <map>
 #include <fstream>
 #include <algorithm>
 #include <iomanip>
 using namespace std;
 //利用map键的唯一性
 //建立key为关键词，value为id的map

 map<string, vector<int>> name;
 map<string, vector<int>> author;
 map<string, vector<int>> keyWord;
 map<string, vector<int>> press;
 map<string, vector<int>> year;//对出版年同样做string对待

 int main(void)
 {
     //ifstream fin("data.txt");

     int num, bookID;
     cin>>num;
     string temp, nameTemp, authorTemp, keyWordLine,
         keyWordTemp, pressTemp, yearTemp;
     for(int i=; i<num; i++)
     {
         cin>>bookID;
         getline(cin, temp);//这里多余的输入去掉回车符
         getline(cin, nameTemp);
         name[nameTemp].push_back(bookID);
         //map下标操作：
         //1.如果存在key,则返回对应的value
         //2.如果key不存在，插入key

         getline(cin, authorTemp);
         author[authorTemp].push_back(bookID);

         //输入一行字符串并且逐个分解单词
         getline(cin, keyWordLine);
         istringstream stream(keyWordLine);
         while(stream >> keyWordTemp)
             keyWord[keyWordTemp].push_back(bookID);

         getline(cin, pressTemp);
         press[pressTemp].push_back(bookID);

         getline(cin, yearTemp);
         year[yearTemp].push_back(bookID);
     }

     int queryNum;
     cin>>queryNum;
     string query;
     getline(cin, temp);//同样去掉整型后面的回车符

     for(int i=; i<queryNum; i++)
     {
         getline(cin, query);
         string queryText(query.begin()+, query.end());//拷贝关键词
         map<string, vector<int>>::iterator it = name.find(queryText);
         if(it != name.end())//关键词存在
         {
             cout<<query<<endl;
             sort(it->second.begin(), it->second.end());//按id顺序
             for(int j=; j<it->second.size(); j++)
                 cout<<setfill('')<<setw()<<it->second[j]<<endl;
             continue;//按照题意,关键词是name keyword author等中的一种
                     //查询到则进行下一次查询
         }

         it = author.find(queryText);
         if(it != author.end())
         {
             cout<<query<<endl;
             sort(it->second.begin(), it->second.end());
             for(int j=; j<it->second.size(); j++)
                 cout<<setfill('')<<setw()<<it->second[j]<<endl;
             continue;
         }

         it = keyWord.find(queryText);
         if(it != keyWord.end())
         {
             cout<<query<<endl;
             sort(it->second.begin(), it->second.end());
             for(int j=; j<it->second.size(); j++)
                 cout<<setfill('')<<setw()<<it->second[j]<<endl;
             continue;
         }

         it = press.find(queryText);
         if(it != press.end())
         {
             cout<<query<<endl;
             sort(it->second.begin(), it->second.end());
             for(int j=; j<it->second.size(); j++)
                 cout<<setfill('')<<setw()<<it->second[j]<<endl;
             continue;
         }

         it = year.find(queryText);
         if(it != year.end())
         {
             cout<<query<<endl;
             sort(it->second.begin(), it->second.end());
             for(int j=; j<it->second.size(); j++)
                 cout<<setfill('')<<setw()<<it->second[j]<<endl;
             continue;
         }

         //未找到
         cout<<query<<endl<<"Not Found"<<endl;
     }

     return ;
 }