This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// author: Halit
#include <bits/stdc++.h>
int main() {
int n, m;
std::cin >> n >> m;
std::vector<std::array<int64_t, 2>> a(n);
for (auto &[x, y] : a) {
std::cin >> x >> y;
std::swap(x, y);
}
std::vector<int64_t> c(m);
for (int64_t &el : c) std::cin >> el;
std::sort(c.rbegin(), c.rend());
std::sort(a.rbegin(), a.rend());
int j = 0;
for (int i = 0;i < n && j < m; ++i) {
if (a[i][1] > c[j]) continue;
else j += 1;
}
std::cout << j;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |