제출 #1154140

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1154140		AlgorithmWarrior	Exhibition (JOI19_ho_t2)	C++20	100 / 100	96 ms	1560 KiB

joi2019_ho_t2

#include <bits/stdc++.h>

using namespace std;

int const MAX=1e5+5;
int n,m;
struct pict{
    int sz,val;
    bool operator<(pict ot){
        if(val!=ot.val)
            return val<ot.val;
        return sz<ot.sz;
    }
}picture[MAX];
int frame[MAX];

void read(){
    cin>>n>>m;
    int i;
    for(i=1;i<=n;++i)
        cin>>picture[i].sz>>picture[i].val;
    for(i=1;i<=m;++i)
        cin>>frame[i];
    sort(picture+1,picture+n+1);
    sort(frame+1,frame+m+1);
}

bool check(int target){
    target=m-target+1;
    int i;
    for(i=1;i<=n && target<=m;++i)
        if(picture[i].sz<=frame[target])
            ++target;
    return (target>m);
}

int bin_search(){
    /// [)
    int st=0,dr=max(n,m)+1;
    while(dr-st>1){
        int mij=(st+dr)/2;
        if(check(mij))
            st=mij;
        else
            dr=mij;
    }
    return st;
}

int main()
{
    read();
    cout<<bin_search();
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 40 / 40
• Subtask 3: 50 / 50