백준 1764번 C++

#include <iostream>

#include <vector>

#include <string>

#include <algorithm>

using namespace std;

int n, m;

vector<string> v;

vector<string> answer;

int main(void) {

cin >> n >> m;

v.resize(n);

for (int i = 0; i < n; i++) {

cin >> v[i];

}

sort(v.begin(), v.end());

for (int i = 0; i < m; i++) {

string name;

cin >> name;

if (binary_search(v.begin(), v.end(), name))

answer.push_back(name);

}

sort(answer.begin(), answer.end());

cout << answer.size() << endl;

for (int i = 0; i < answer.size(); i++) {

cout << answer[i] << endl;

}

}