Submission #1091733

#	Time	Username	Problem	Language	Result	Execution time	Memory
1091733		BlueGlaucus1	Exhibition (JOI19_ho_t2)	C++17	100 / 100	99 ms	4480 KiB

joi2019_ho_t2

#include <iostream>
#include <algorithm>
using namespace std;

int main(){
    int n,m; cin >> n >> m;
    pair<int, int> paint[n];
    int frame[m];
    for(int i =0; i <n;i++){
        cin >> paint[i].second >> paint[i].first;
    }
    for(int i = 0; i <m;i++){
        cin >> frame[i];
    }
    sort(paint, paint+n);
    sort(frame, frame+m);
    int paint_i = n-1;
    int answer = 0;
    for(int i = m-1; i>=0;i--){
        int size = frame[i];
        while(paint_i >=0 && paint[paint_i].second > size){
            paint_i--;
        }
        if(paint_i<0){
            cout << answer <<'\n';
            return 0;
        }
        paint_i-=1;
        answer +=1;
    }
    cout << answer <<'\n';
    return 0 ;

}

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