제출 #391341

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
391341		timmyfeng	Exhibition (JOI19_ho_t2)	C++17	100 / 100	99 ms	1596 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
using namespace std;

const int N = 100000;

array<int, 2> pics[N];
int frames[N];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m;
    cin >> n >> m;

    for (int i = 0; i < n; ++i) {
        auto &[v, s] = pics[i];
        cin >> s >> v;
    }
    sort(pics, pics + n);

    for (int i = 0; i < m; ++i) {
        cin >> frames[i];
    }
    sort(frames, frames + m);

    int low = 0, high = m;
    while (low < high) {
        int mid = (low + high + 1) / 2;

        int j = 0;
        for (int i = 0; i < n && j < mid; ++i) {
            auto [v, s] = pics[i];
            j += s <= frames[m - mid + j];
        }

        if (j == mid) {
            low = mid;
        } else {
            high = mid - 1;
        }
    }

    cout << high << "\n";
}

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