| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 520774 | cig32 | Exhibition (JOI19_ho_t2) | C++17 | 1 ms | 204 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 int long long
using namespace std;
const int MAXN = 1e6 + 10;
int32_t main() {
int n, m, j = 0, ans = 0;
cin >> n >> m;
pair<int, int> a[n+1];
for(int i=1; i<=n; i++) {
cin >> a[i].first >> a[i].second;
swap(a[i].first, a[i].second);
}
int b[m+1];
for(int i=1; i<=m; i++) cin >> b[i];
sort(a+1, a+n+1);
sort(b+1, b+m+1);
reverse(a+1, a+n+1);
reverse(b+1, b+m+1);
for(int i=1; i<=m; i++) {
while(j < n && a[j].second > b[i]) j++;
ans += (j < n ? 1 : 0);
j++;
}
cout << ans << "\n";
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
