제출 #1014159

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1014159		thinknoexit	Exhibition (JOI19_ho_t2)	C++17	100 / 100	45 ms	1632 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
pair<int, int> a[100100];
int b[100100];
int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n, m;
    cin >> n >> m;
    for (int i = 1;i <= n;i++) cin >> a[i].second >> a[i].first;
    for (int i = 1;i <= m;i++) cin >> b[i];
    sort(a + 1, a + 1 + n, greater<pair<int, int>>());
    sort(b + 1, b + 1 + m, greater<int>());
    int ans = 0;
    for (int i = 1;i <= n;i++) {
        int idx = upper_bound(b + 1, b + 1 + m, a[i].second, greater<int>()) - b - 1;
        if (ans + 1 <= idx) ans++;
    }
    cout << ans;
    return 0;
}

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