Submission #703688

#TimeUsernameProblemLanguageResultExecution timeMemory
703688qwe1rt1yuiop1Exhibition (JOI19_ho_t2)C++14
100 / 100
56 ms5692 KiB
#include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int, int> pii;

inline void solve()
{
    int n, m;
    cin >> n >> m;
    vector<pii> v(n);
    for (pii &i : v)
        cin >> i.second >> i.first;
    vector<int> f(m);
    for (auto &i : f)
        cin >> i;
    sort(v.begin(), v.end()), sort(f.begin(), f.end());
    reverse(v.begin(), v.end()), reverse(f.begin(), f.end());

    // cout << '\n';
    // for (auto i : v)
    //     cout << i.first << ' ' << i.second << '\n';
    // for (int i : f)
    //     cout << i << ' ';
    // cout << '\n';

    int ans = 0;
    for (int i = 0; i < n && ans < m; ++i)
    {
        if (v[i].second <= f[ans])
            ++ans;
    }
    cout << ans << '\n';
}

signed main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    solve();

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...