algorithm'''problem solve
[백준]1764 - 듣보잡(설명X)
JunHwa Park
2020. 4. 8. 16:50
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 | #include <iostream> #include <string> #include <set> #include <list> using namespace std; int main() { set<string> n_set; list<string> dup; int N, M; cin >> N >> M; for (int i = 0; i < N; i++) { string str; cin >> str; n_set.insert(str); } for (int i = 0; i < M; i++) { string str; cin >> str; if (n_set.find(str) != n_set.end()) dup.push_back(str); } dup.sort(); cout << dup.size() << endl; list<string>::iterator iter; for (iter = dup.begin(); iter != dup.end(); iter++) cout << *iter << endl; } | cs |