제출 #465108

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
465108		Baray	Exhibition (JOI19_ho_t2)	C++17	100 / 100	160 ms	4392 KiB

joi2019_ho_t2

#include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <climits>
#include <deque>

using namespace std;

#define ll long long

ll n, m, x, y, ans;

int main() {
    cin >> n >> m;
    
    vector<pair<int, int> > arr(n);
    vector<int> frames(m);

    for (int i = 0; i < n; i++) {
        cin >> x >> y;
        arr[i].first = y;
        arr[i].second = x;
    }

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

    sort(arr.begin(), arr.end());
    sort(frames.begin(), frames.end());

    int cur = m - 1;
    for (int i = n - 1; i >= 0; i--) {
        if (arr[i].second <= frames[cur]) {
            cur--;
            ans++;
            if (cur < 0) {
                cout << ans;
                return 0;
            }
        }
    }

    cout << ans;
}

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