#include <bits/stdc++.h> using namespace std; //思路：结构体数组，遍历之，先试试，害怕超时 //struct node //{ //    int vis={0}; //    char name[50]; //}stu[10005]; // //int main() //{ //    int n; //    cin>>n; //    ...

#include<iostream> #include<string> #include<map> using namespace std; int main() { int n, M; string s; while (cin >> n) { map<string, int>m; for (int i = 0; i < n; i++) { cin >> s; m[s] = 0; } cin >> M; for (int i = 0; i ...

int main() { int n, M; string s; while (cin >> n) { map<string, int>m; for (int i = 0; i < n; i++) { cin >> s; m[s] = 0; } cin >> M; for (int i = 0; i < M; i++) { cin >> s; if (m.find(s) != m.end()) { if (m[s] == 0) { ...