제출 #1237354

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1237354		M_SH_O	Exhibition (JOI19_ho_t2)	C++20	100 / 100	45 ms	3568 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>
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>*/

#define ll long long
#define ll1 long long
#define ull unsigned long long
#define dou long double
#define str string
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vbool vector<bool>
#define vstr vector<str>
#define vvll vector<vll>
#define pb push_back
#define pf push_front
#define endl "\n"
#define fr first
#define se second
// #define sortcmp(a) sort(a.begin(), a.end(), cmp)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define INF 1000000000000000007
#define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>

using namespace std;
//using namespace __gnu_pbds;

mt19937 rng(time(0));
ll randll(ll l, ll r) {
    return uniform_int_distribution<ll>(l, r)(rng);
}

int main(){
    speed;
    srand(time(0));

    ll n, m;
    cin >> n >> m;
    vpll a(n);
    vll  c(m);
    for (int i = 0; i < n ;i ++) {
        cin >> a[i].se >> a[i].fr;
    }
    sort(a);

    for (int i = 0; i < m; i ++) {
        cin >> c[i];
    }
    sort(c);

    vll dp(m+7, 0);
    reverse(c);
    reverse(a);
    ll res = 0;
    for (int i = 0; i < n; i ++) {
        if (c[res] < a[i].se) continue;
        res ++;
        if (res == m) break;
    }

    cout << res << endl;
}

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