제출 #868195

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
868195		MongHwa	Exhibition (JOI19_ho_t2)	C++17	100 / 100	45 ms	4764 KiB

joi2019_ho_t2

#include <iostream>
#include <algorithm>
using namespace std;

#define X first
#define Y second

pair<int, int> arr[100001];
int brr[100001];

bool cmp(pair<int, int>& a, pair<int, int>& b)
{
    if(a.Y != b.Y)
        return a.Y > b.Y;
    return a.X > b.X;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    
    int n, m;
    cin >> n >> m;

    for(int i = 0; i < n; i++)
        cin >> arr[i].X >> arr[i].Y;
    for(int i = 0; i < m; i++)
        cin >> brr[i];
    
    sort(arr, arr+n, cmp);
    sort(brr, brr+m);

    int ans = 0, pos = m-1;
    for(int i = 0; i < n; i++)
        if(pos >= 0 && arr[i].X <= brr[pos])
        {
            ans++;
            pos--;
        }

    cout << ans << '\n';
}

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