# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
753423 | IvanJ | Exhibition (JOI19_ho_t2) | C++17 | 77 ms | 5580 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>
#define x first
#define y second
#define pb push_back
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int maxn = 1e5 + 5;
int n, m;
int s[maxn], v[maxn], c[maxn];
vector<ii> V;
int check(int pos) {
for(ii p : V)
if(pos < m && p.y <= c[pos]) pos++;
return (pos == m);
}
int main() {
scanf("%d%d", &n, &m);
for(int i = 0;i < n;i++)
scanf("%d%d", s + i, v + i);
for(int i = 0;i < m;i++)
scanf("%d", c + i);
for(int i = 0;i < n;i++) V.pb({v[i], s[i]});
sort(all(V));
sort(c, c + m);
int lo = 0, hi = m - 1, ans = m;
while(lo <= hi) {
int mid = (lo + hi) / 2;
if(check(mid)) ans = mid, hi = mid - 1;
else lo = mid + 1;
}
printf("%d\n", m - ans);
return 0;
}
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... |