Submission #1063208

#	Time	Username	Problem	Language	Result	Execution time	Memory
1063208		_8_8_	Exhibition (JOI19_ho_t2)	C++17	100 / 100	55 ms	4524 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
    
using namespace std;
    
typedef long long ll;
const int  N = 1e5 + 12, MOD = (int)1e9 + 7;

array<int,2> a[N];
int n,m,b[N];
void test() {
    cin >> n >> m;
    for(int i = 1;i <= n;i++) {
        cin >> a[i][1] >> a[i][0];
    }
    sort(a + 1,a + n + 1);
    for(int i = 1;i <= m;i++) {
        cin >> b[i];
    }
    sort(b + 1,b + m + 1);
    int it = n + 1;
    int res = 0;
    for(int i = m;i >= 1;i--) {
        it--;
        while(it >= 1 && a[it][1] > b[i]) {
            it--;
        }
        if(!it) break;
        res++;
    }
    cout << res;
}
int main() {
    ios_base::sync_with_stdio(false);cin.tie(0);
    int t = 1; 
    // cin >> t;
    while(t--) {
        test();
    }
}  

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