This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int MXN = 100005;
int n, m;
priority_queue<pair<int, int>> p;
int f[MXN];
signed main() {
cin >> n >> m;
for (int i=0; i<n; i++) {
int s, v;
cin >> s >> v;
p.push({v, s});
}
for (int i=0; i<m; i++) {
cin >> f[i];
}
sort(f, f+m);
int ans = 0;
for (int i=m-1; i>=0; i--) {
while (!p.empty() && p.top().second > f[i]) {
p.pop();
}
if (p.empty()) continue;
p.pop();
ans++;
}
cout << ans << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |