Submission #106790

#TimeUsernameProblemLanguageResultExecution timeMemory
106790FiloSanzaExhibition (JOI19_ho_t2)C++14
100 / 100
83 ms4600 KiB
#include <bits/stdc++.h>
using namespace std;

int main(){
    cin.tie(0);
    cin.sync_with_stdio(0);

    int N, M;
    cin >> N >> M;

    vector<pair<int, int>> v(N);
    vector<int> f(M);

    for(auto &i : v) cin >> i.second >> i.first;
    for(auto &i : f) cin >> i;
    sort(v.begin(), v.end());
    sort(f.begin(), f.end());

    int ans = 0;
    for(int i=N-1; i>=0 && ans<M; i--){
        if(v[i].second <= f[M-1-ans])
            ans++;
    }
    cout << ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...