Submission #669660

#TimeUsernameProblemLanguageResultExecution timeMemory
669660Darren0724Exhibition (JOI19_ho_t2)C++17
50 / 100
48 ms5592 KiB
//challenge: 100
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(),x.end()
#define x first
#define y second

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n,m;cin>>n>>m;
    vector<pair<int,int>> v(n);
    for(int i=0;i<n;i++){
        cin>>v[i].y>>v[i].x;
    }
    vector<int> a(m);
    for(int i=0;i<m;i++){
        cin>>a[i];
    }
    sort(all(v));
    sort(all(a));
    int ans=0;
    for(int i=n-1;i>=0;i--){
        if(a[m-1-ans]>=v[i].y){
            ans++;
        }
    }
    cout<<ans<<endl;

    return 0;
}


#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...