제출 #336631

#제출 시각아이디문제언어결과실행 시간메모리
336631saarang123Exhibition (JOI19_ho_t2)C++14
100 / 100
57 ms4588 KiB
#include <bits/stdc++.h>
using namespace std;

signed main() {
    std::ios::sync_with_stdio(0);
    std::cout.tie(0);
    std::cin.tie(0);
    int n, m; cin >> n >> m;
    vector<array<int, 2>> a(n);
    for(auto &in : a) cin >> in[1] >> in[0];
    vector<int> c(m);
    for(int &x : c) cin >> x;
    int ans = 0;
    sort(a.begin(), a.end(), greater<>());
    sort(c.begin(), c.end());
    for(int i = 0; i < n && ans < m; i++) {
        int sz = a[i][1];
        if(c[m - 1 - ans] >= sz)
            ans++;
    }
    cout << ans << '\n';
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...