Submission #1325632

#TimeUsernameProblemLanguageResultExecution timeMemory
1325632AgageldiExhibition (JOI19_ho_t2)C++20
100 / 100
35 ms2788 KiB
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define N 500005

const int inf = 1e18;

int tc = 1, n, a[N], c[N], m;
pair<int,int> s[N];

int32_t main() {
    ios::sync_with_stdio(0);cin.tie(0);
    cin >> n >> m;
    for(int i = 1; i <= n; i++) {
        cin >> s[i].second >> s[i].first;
    }
    for(int i = 1; i <= m; i++) {
        cin >> c[i];
    }
    sort(s + 1, s + n + 1);
    reverse(s + 1, s + n + 1);
    sort(c + 1, c + m + 1);
    int cnt = m;
    for(int i = 1; i <= n; i++) {
        if(s[i].second <= c[cnt]) {
            cnt--;
        }
    }
    cout << m - cnt << '\n';
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...