chuanzhi-cup/final-contest/1.cpp


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

#include <iostream>
#include <unordered_set>

int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int n, m;
  std::cin >> n >> m;

  std::unordered_set<int> a;

  for (int i = 0; i < n; i++) {
    int j;
    std::cin >> j;
    a.insert(j);
  }

  int count = 0;

  for (int i = 0; i < m; i++) {
    int j;
    std::cin >> j;
    if (a.count(j)) {
      count++;
    }
  }

  std::cout << count;

  return 0;
}