제출 #1099247

#제출 시각아이디문제언어결과실행 시간메모리
1099247LuvidiExhibition (JOI19_ho_t2)C++17
100 / 100
43 ms4520 KiB
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define fs first
#define sc second
#define pb push_back

void solve(){
    int n,m;
    cin>>n>>m;
    pii a[n];
    for(int i=0;i<n;i++)cin>>a[i].sc>>a[i].fs;
    int c[m];
    for(int i=0;i<m;i++)cin>>c[i];
    sort(a,a+n);
    sort(c,c+m);
    int l=0,r=m;
    while(l<r){
        int md=(l+r+1)/2;
        int idx=m-md;
        for(auto[z,x]:a){
            if(idx==m)break;
            if(c[idx]>=x)idx++;
        }
        if(idx==m)l=md;
        else r=md-1;
    }
    cout<<l;
}

int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

    solve();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...