제출 #898243

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
898243		andrei_iorgulescu	Exhibition (JOI19_ho_t2)	C++14	100 / 100	47 ms	4788 KiB

joi2019_ho_t2

#include <bits/stdc++.h>

using namespace std;

int n,m;
pair<int,int>a[100005];
int v[100005];

bool cmp(pair<int,int> A, pair<int,int> B)
{
    if (A.first != B.first)
        return A.first > B.first;
    return A.second > B.second;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    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 >> v[i];
    sort(v + 1,v + m + 1);
    reverse(v + 1,v + m + 1);
    sort(a + 1,a + n + 1,cmp);
    int ans = 0;
    int ind = 1;
    for (int i = 1; i <= m; i++)
    {
        while (ind <= n and a[ind].second > v[i])
            ind++;
        if (ind == n + 1)
            break;
        ind++;
        ans++;
    }
    cout << ans;
    return 0;
}

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