제출 #1126469

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1126469		ALTAKEXE	Exhibition (JOI19_ho_t2)	C++20	100 / 100	111 ms	1932 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define inf INT_MAX
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FAR(i, a, b) for (int i = (a); i >= (b); i--)
#define all(x) (x.begin(), x.end())
const int MOD = 1e9 + 7;
using namespace std;
int main()
{
    int n, m, ans = 0;
    cin >> n >> m;
    vector<pair<int, int>> v;
    int c[m];
    for (int i = 0; i < n; i++)
    {
        int x, y;
        cin >> x >> y;
        v.push_back({y, x});
    }
    for (int i = 0; i < m; i++)
        cin >> c[i];
    sort(v.begin(), v.end());
    sort(c, c + m);
    for (int i = n - 1, j = m - 1; i >= 0 && j >= 0;)
    {
        if (v[i].ss <= c[j])
        {
            i--;
            j--;
            ans++;
        }
        else
            i--;
    }
    cout << ans << endl;
    return 0;
}

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