제출 #377892

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
377892		smjleo	Exhibition (JOI19_ho_t2)	C++14	100 / 100	77 ms	8016 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
#define int long long
#define nl '\n'
#define io ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
mt19937 rng((unsigned)chrono::steady_clock::now().time_since_epoch().count());
const int mod = 1000000007, mod2 = 998244353;

// change this
const int N = 100005;

int n, m, frame[N], ans;
pair<int, int> pic[N];

signed main() {
    io;
    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 >> frame[i];

    sort(frame, frame+m, greater<>());

    priority_queue< pair<int, int> > pics;
    for (int i=0; i<n; i++) pics.push({pic[i].second, pic[i].first});   // value, size

    for (int i=0; i<m; i++) {
        // try this frame
        while (!pics.empty() && pics.top().second > frame[i]) pics.pop();  // too big
        if (pics.empty()) break;
        pics.pop(); // can add this
        ans++;
    }
    cout << ans << nl;
}

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