# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97385 | Bruteforceman | Exhibition (JOI19_ho_t2) | C++11 | 95 ms | 1572 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;
typedef pair <int, int> pii;
pii a[100010];
int c[100010];
int opt[100010];
int main(int argc, char const *argv[])
{
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]);
}
sort(a + 1, a + n + 1);
sort(c + 1, c + m + 1);
int cur = n;
int ans = 0;
for(int i = m; i >= 1; i--) {
while(cur > 0 && a[cur].second > c[i]) {
--cur;
}
if(cur > 0) {
++ans;
--cur;
}
}
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... |