제출 #529944

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
529944		scottchou	Exhibition (JOI19_ho_t2)	C++17	100 / 100	298 ms	5376 KiB

joi2019_ho_t2

#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
int const N = 1e5 + 5;
typedef pair<int, int> pii;
pii pic[N];
int c[N], n, m;
bool check(int x){
    int idx = 0;
    priority_queue<int, vector<int>, greater<int> > pq;
    int last = 0;
    for(int i = x - 1; i >= 0; i--){
        while(idx < n && pic[idx].first <= c[i]){
            if(pic[idx].second >= last)
                pq.push(pic[idx].second);
            idx++;
        }
        if(pq.empty()){
           return 0;
        }
        last = pq.top();
        pq.pop();
    }
    return 1;
}
int main(){
    cin >> n >> m;
    for(int i = 0; i < n; i++){
        cin >> pic[i].first >> pic[i].second;
    }
    for(int i = 0; i < m; i++){
        cin >> c[i];
    }
    sort(pic, pic + n);
    sort(c, c + m);
    reverse(c, c + m);
    int l = 0, r = n;
    while(l < r){
        int mid = l + r + 1 >> 1;
        if(check(mid)){
            l = mid;
        }else{
            r = mid - 1;
        }
    }
    cout << l << '\n';
}

컴파일 시 표준 에러 (stderr) 메시지

joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:40:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   40 |         int mid = l + r + 1 >> 1;
      |                   ~~~~~~^~~

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