/
BAEKJOON 1764
33 lines (31 loc) · 906 Bytes
/
BAEKJOON 1764
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
32
33
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.PriorityQueue;
import java.util.Set;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws Exception{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
Set<String> hash = new HashSet<>();
PriorityQueue<String> pq = new PriorityQueue<>((a,b) -> a.compareTo(b));
StringTokenizer st = new StringTokenizer(br.readLine());
int N = Integer.parseInt(st.nextToken());
int M = Integer.parseInt(st.nextToken());
int ans = 0;
for (int i = 0; i <N; i++) {
hash.add(br.readLine());
}
for (int i = 0; i < M; i++) {
String str = br.readLine();
if(hash.contains(str)) {
pq.add(str);
ans++;
}
}
System.out.println(ans);
for (int i = 0; i < ans; i++) {
System.out.println(pq.poll());
}
}
}