代码已通过测试
#include#include #include #include using namespace std; struct record { string info[6]; }; vector > result; vector n; vector s; int N; vector library; void getResult(int count,int number, string search) { for (int i = 0; i < N; i++) { if (number == 3) { string::size_type idx; idx = library[i].info[number].find(search); if (idx != string::npos) result[count].insert(library[i].info[0]); continue; } if (library[i].info[number] == search) result[count].insert(library[i].info[0]); } } int main() { cin >> N; cin.get(); library.resize(N); for (int i = 0; i < N; i++) { getline(cin,library[i].info[0]); getline(cin,library[i].info[1]); getline(cin, library[i].info[2]); getline(cin, library[i].info[3]); getline(cin, library[i].info[4]); getline(cin,library[i].info[5]); } int M; cin >> M; result.resize(M); for (int i = 1; i <= M; i++) { int number; string search; cin >> number; getchar(); getchar(); getline(cin, search); getResult(i-1,number, search); n.push_back(number); s.push_back(search); } for (int i = 1; i <= M; i++) { cout << n[i-1] << ": " << s[i-1] << endl;; if (result[i-1].size() == 0) { cout << "Not Found" << endl; continue; } for (auto it:result[i-1]) { cout <



