store/works/life/chuanzhi-cup/final-contest/5.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
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48

#include <algorithm>
#include <iostream>

int n, m;
int w[100010];
int c[100010];

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

  std::cin >> n >> m;

  for (int i = 0; i < n; i++) {
    std::cin >> w[i];
  }

  for (int i = 0; i < m; i++) {
    std::cin >> c[i];
  }

  std::sort(w, w + n);
  std::sort(c, c + m);

  int a = 0, b = 0;
  int count = 0;

  while (true) {
    if (a == n) {
      break;
    }
    if (b == m) {
      break;
    }

    if (w[a] >= c[b]) {
      a++;
      b++;
      count++;
    } else {
      a++;
    }
  }

  std::cout << count;

  return 0;
}