제출 #915964

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
915964		HorizonWest	Exhibition (JOI19_ho_t2)	C++17	100 / 100	59 ms	8396 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define db double
#define ll __int128
#define int long long
#define pb push_back
#define fs first
#define sd second
#define Mod long(1e9 + 7)
#define all(x) x.begin(), x.end()
#define unvisited long(-1)
#define Eps double(1e-9)
#define _for(i, n) for(int i = 0; i < (n); i++)
#define dbg(x) cout << #x ": " << x << endl;

const int Max = 1e6 + 7, Inf = 1e15 + 7;

void print(bool x) { cout << (x ? "YES" : "NO") << endl; }

string tostring (__int128 x)
{
    string ans = "";
    while(x > 0)
    {
        ans += (x % 10 + '0');
        x /= 10;
    }
    reverse(all(ans));
    return ans;
}

void solve()
{
    int n, m, ans = 0; cin >> n >> m;
    vector <pair<int, int>> v(n);
    vector <int> c(m);
    for(auto& u : v) cin >> u.fs >> u.sd;
    for(auto& u : c) cin >> u;

    sort(all(v)); sort(all(c)); reverse(all(c));

    priority_queue <pair<int, int>> pq;

    for(int i = 0; i < n; i++)
        pq.push({ v[i].sd, i });

    for(int i = 0; i < m; i++)
    {
        while(!pq.empty())
        {
            if(v[pq.top().sd].fs > c[i])    
                pq.pop();
            else 
                break;
        }

        if(pq.empty()) break;
        ans++; pq.pop();
    }

    cout << ans << endl;
}

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int Q = 1; //cin >> Q;

    while (Q--)
    {
        solve();
    }

    return 0;
}

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