Submission #97512

#TimeUsernameProblemLanguageResultExecution timeMemory
97512dalgerokExhibition (JOI19_ho_t2)C++14
0 / 100
4 ms428 KiB
#include<bits/stdc++.h>
using namespace std;


const int N = 1e5 + 5;




int n, m, b[N];
pair < int, int > a[N];


int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
        cin >> a[i].second >> a[i].first;
    }
    for(int i = 1; i <= m; i++){
        cin >> b[i];
    }
    sort(a + 1, a + n + 1);
    reverse(a + 1, a + n + 1);
    sort(b + 1, b + n + 1);
    reverse(b + 1, b + n + 1);
    int ans = 1;
    for(int i = 1; i <= n; i++){
        if(a[i].second <= b[ans]){
            ans += 1;
        }
    }
    cout << ans - 1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...