Submission #70842681

---

Source Code Expand

#include <bits/stdc++.h>

#define endl '\n'
#define ll long long
#define db double

using namespace std;
const int M = 1e5 + 5;
//mt19937_64 rnd(time(0));

void sol() {
    int n, m, k;
    cin >> n >> m >> k;
    vector<int> h, b;
    for (int i = 0; i < n; i++) {
        int x;
        cin >> x;
        h.push_back(x);
    }
    for (int i = 0; i < m; i++) {
        int x;
        cin >> x;
        b.push_back(x);
    }
    sort(h.begin(), h.end());
    sort(b.begin(), b.end());
    int i = 0, j = 0;
    while (i < n && j < m) {
        if (h[i] <= b[j]) {
            i++, j++, k--;
        } else {
            j++;
        }
    }

    if (k <= 0) cout << "Yes" << endl;
    else cout << "No" << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
//    cin >> T;
    while (T--) sol();
}

Submission Info

Judge Result