제출 #926285

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

int main() {
    int n, m;
    cin >> n >> m;

    vector<pair<int, int> > v(n);
    vector<int> c(m);
    for(auto &x : v) cin >> x.second >> x.first;
    for(int &x : c) cin >> x;

    sort(v.rbegin(), v.rend());
    sort(c.rbegin(), c.rend());

    int j = 0;
    for(int i=0; i<n; i++)
        if(v[i].second <= c[j]) j++;
    cout << j << '\n';
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...