Submission #70771357

---

Source Code Expand

#include <bits/stdc++.h>
#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...) 0
#endif
using namespace std;
using ll = long long;
using db = double;
const ll N = 1e6 + 5;
const ll md = 998244353;
const ll MOD = 1e9 + 7;
const ll INF = 0x3f3f3f3f3f3f3f;
const db PI = acos(-1);
const db eps = 1e-6;
const db E = 2.718281828459045;
typedef pair<ll, ll> PLL;
#define fi first
#define se second
ll a[N], b[N];
void solve()
{
    ll n, m, k;
    cin >> n >> m >> k;
    for (ll i = 1; i <= n;i++)
        cin >> a[i];
    for (ll i = 1; i <= m;i++)
        cin >> b[i];
    sort(a + 1, a + 1 + n);
    sort(b + 1, b + 1 + m);
    ll cnt = 0;
    ll j = 1;
    for (ll i = 1; i <= n;i++)
    {
        while(j<=m&&b[j]<a[i])
            j++;
        if(j<=m)
        {
            cnt++;
            j++;
        }
    }
    if(cnt>=k)
        cout << "Yes\n";
    else
        cout << "No\n";
}
int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int T;
    T = 1;
    //cin>>T;
    while (T--)
    {
        solve();
    }
}

Submission Info

Judge Result