Submission #1050962

#	Time	Username	Problem	Language	Result	Execution time	Memory
1050962		fryingduc	Exhibition (JOI19_ho_t2)	C++17	100 / 100	33 ms	4512 KiB

joi2019_ho_t2

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

const int maxn = 1e5 + 5;
int n, m, c[maxn];
pair<int, int> a[maxn];

int f[maxn];

void solve() {
    cin >> n >> m;
    for(int i = 1; i <= n; ++i) {
        cin >> a[i].second >> a[i].first;
    }
    sort(a + 1, a + n + 1);
    for(int i = 1; i <= m; ++i) {
        cin >> c[i];
    }
    sort(c + 1, c + m + 1);
    
    int j = n, ans = 0;
    for(int i = m; i; --i) {
        while(j and a[j].second > c[i]) --j;
        if(j and a[j].second <= c[i]) {
            --j;
            ++ans;
        }
    }
    
    cout << ans;
}
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    solve();
    return 0;
}

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