Submission #1128268

#	Time	Username	Problem	Language	Result	Execution time	Memory
1128268		Haciyev12	Exhibition (JOI19_ho_t2)	C++20	0 / 100	1 ms	324 KiB

joi2019_ho_t2

#include "bits/stdc++.h"
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define pb push_back
#define in insert
#define F first
#define S second
#define vll vector<ll>
#define all(v) v.begin(),v.end()
#define endl '\n'
#define pii pair<ll,ll>
#define yes cout << "YES" << endl;
#define no cout << "NO" << endl;
using namespace std;

const ll INF = 1e18, mod = 1e9 + 7, N = 2e5 + 5;

ll gcd(ll a, ll b) {
    if (b == 0) {
        return a;
    }
    return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return (a / gcd(a, b)) * b;
}

void solve() {
    ll n, m;
    cin >> n >> m;
    vector<pii> v; 
    ll x, y;

    for (int i = 0; i < n; i++) {
        cin >> x >> y;
        v.pb({y, x});
    }

    vector<pii> f; 
    ll r;

    for (int i = 0; i < m; i++) {
        cin >> r;
        f.pb({r, i});
    }

    sort(all(f));
    sort(all(v));

    ll cnt = 0;
    set<ll> used;
    ll in = -1;

    for (int i = 0; i < n; i++) {
        if(f.size() == 0){
            break;
        }
        auto it = lower_bound(f.begin(), f.end(), make_pair(v[i].S, -1LL));
        if (it == f.end()) {
            cout << cnt << endl;
            return;
        }
        if (in < it->S) {
            cnt++;
            in = it->S;
        }
        
        f.erase(it);
    }

    cout << cnt << endl;
}

int main() {
    fast;
    ll t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}

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