제출 #1266010

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1266010		trinm01	Exhibition (JOI19_ho_t2)	C++20	100 / 100	31 ms	2736 KiB

joi2019_ho_t2

// #pragma GCC optimize("O3")
// #pragma GCC optimization("Ofast,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;

#define int long long 
#define ll long long
#define FOR(i, l, r) for (int i = (l); i <= (r); i++)
#define FOD(i, r, l) for (int i = (r); i >= (l); i--)
#define fi first
#define se second
#define pii pair<int, int>

const ll mod = 1e9 + 7;
const int MAXN = 1e5 + 5;
const ll oo = 1e18+7;  
const int base = 0;

int n, m;
pii a[MAXN];
int c[MAXN];

bool cmp(pii a, pii b){
    if(a.se==b.se){
        return a.fi<b.fi;
    }
    return a.se<b.se;
}

pii f[MAXN];

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    // freopen("test.txt", "r", stdin);
    // freopen("o2.out", "w", stdout); 

    // if(fopen(".inp", "r")){
    //     freopen(".inp", "r", stdin);
    //     freopen(".out", "w", stdout);
    // }   

    cin >> n >> m;
    FOR(i, 1, n){
        cin >> a[i].fi >> a[i].se;
    }   
    FOR(i, 1, m){
        cin >> c[i];
    }

    sort(c+1, c+1+m);
    sort(a+1, a+1+n, cmp);
    
    int j=m;
    int res=0;
    FOD(i, n, 1){
        if(j==0) break;
        if(a[i].fi<=c[j]){
            res++;
            j--;
        }
    }

    cout << res;
    
    return 0;
}

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