Submission #719040

#TimeUsernameProblemLanguageResultExecution timeMemory
719040thimote75Exhibition (JOI19_ho_t2)C++14
100 / 100
54 ms4440 KiB

#include <bits/stdc++.h>

using namespace std;

#define di pair<int, int>

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int N, M;
    cin >> N >> M;

    vector<di> objects(N);
    vector<int> sizes(M);

    for (int i = 0; i < N; i ++) {
        int s, v;
        cin >> s >> v;

        objects[i] = { v, s };
    }

    for (int j = 0; j < M; j ++)
        cin >> sizes[j];

    sort(objects.rbegin(), objects.rend());
    sort(sizes  .rbegin(), sizes  .rend());

    int cursor = 0;
    for (int i = 0; i < N; i ++) {
        if (cursor == M) break ;

        int size = objects[i].second;
        if (size > sizes[cursor]) continue ;

        cursor ++;
    }

    cout << cursor;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...