제출 #780573

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
780573		borisAngelov	Exhibition (JOI19_ho_t2)	C++17	0 / 100	1 ms	212 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];

bool cmp(pair<int, int> p1, pair<int, int> p2)
{
    if (p1.second == p2.second)
    {
        return p1.first <= p2.first;
    }

    return p1.second > p2.second;
}

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)
    {
        cin >> a[i].first >> a[i].second;
    }

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

    sort(a + 1, a + n + 1, cmp);
    sort(b + 1, b + m + 1, greater<int>());

    int ans = 0;
    int ptr = 1;

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

    cout << ans << endl;

    return 0;
}

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