# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
127616 | IOrtroiii | Exhibition (JOI19_ho_t2) | C++14 | 87 ms | 2424 KiB |
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 N = 100100;
int c[N];
pair<int, int> a[N];
int main() {
int n, m;
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; ++i) {
scanf("%d %d", &a[i].second, &a[i].first);
}
for (int i = 1; i <= m; ++i) {
scanf("%d", c + i);
}
int ans = 0;
int ptr = n;
sort(a + 1, a + n + 1);
sort(c + 1, c + m + 1);
for (int i = m; i > 0; --i) {
while (ptr > 0 && a[ptr].second > c[i]) {
--ptr;
}
if (ptr) {
++ans;
--ptr;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |