Submission #780582

#	Time	Username	Problem	Language	Result	Execution time	Memory
780582		borisAngelov	Exhibition (JOI19_ho_t2)	C++17	100 / 100	43 ms	4540 KiB

joi2019_ho_t2

#include <bits/stdc++.h>

using namespace std;

const int maxn = 100005;

int n, m;

pair<int, int> a[maxn];
int b[maxn];

void fastIO()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int main()
{
    fastIO();

    cin >> n >> m;

    for (int i = 1; i <= n; ++i)
    {
        int value, sz;
        cin >> sz >> value;

        a[i] = make_pair(value, sz);
    }

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

    sort(a + 1, a + n + 1);
    sort(b + 1, b + m + 1);

    int ans = 0;

    for (int i = n; i >= 1 && ans < m; --i)
    {
        if (a[i].second <= b[m - ans])
        {
            ++ans;
        }
    }

    cout << ans << endl;

    return 0;
}

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