Submission #73190883

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

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

    int n, m;
    if (!(cin >> n >> m)) return 0;

    vector<int> c(n);
    for (int i = 0; i < n; ++i) cin >> c[i];

    vector<int> r(m);
    for (int i = 0; i < m; ++i) cin >> r[i];

    sort(c.begin(), c.end());
    sort(r.begin(), r.end());

    int i = 0, j = 0, k = 0;

    while (i < n && j < m) {
        if (r[j] >= c[i]) {
            k++;
            i++;
            j++;
        } else {
            j++;
        }
    }

    cout << k << endl;

    return 0;
}

Submission Info

Judge Result