제출 #336438

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
336438		arujbansal	Exhibition (JOI19_ho_t2)	C++17	100 / 100	61 ms	4588 KiB

joi2019_ho_t2

#include <bits/stdc++.h>

#define rng_init mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
using namespace std;
using ll = long long;

const int MAXN = 1e5 + 5, INF = 1e9 + 5;

void solve() {
    int n, m;
    cin >> n >> m;

    vector<pair<int, int>> pictures(n);
    for (auto &[val, sz] : pictures)
        cin >> sz >> val;

    vector<int> frames(m);
    for (auto &x : frames)
        cin >> x;

    sort(pictures.begin(), pictures.end(), greater<>());
    sort(frames.begin(), frames.end());

    int ans = 0;

    for (const auto &[val, sz] : pictures)
        ans += (frames[m - ans - 1] >= sz);

    cout << ans;
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int tc = 1;
    // cin >> tc;
    while (tc--) solve();
}

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