# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97390 | kdh9949 | Exhibition (JOI19_ho_t2) | C++17 | 102 ms | 1568 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;
using pii = pair<int, int>;
#define x first
#define y second
const int N = 100005;
int n, m, c[N], r;
pii a[N];
int main(){
scanf("%d%d", &n, &m);
for(int i = 0; i < n; i++) scanf("%d%d", &a[i].y, &a[i].x);
sort(a, a + n, greater<pii>());
for(int i = 0; i < m; i++) scanf("%d", c + i);
sort(c, c + m, greater<int>());
for(int i = 0; i < n; i++) if(a[i].y <= c[r]) r++;
printf("%d\n", r);
}
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... |