| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 788313 | 12345678 | Exhibition (JOI19_ho_t2) | C++17 | 45 ms | 3632 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;
int n, m;
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n>>m;
vector<pair<int, int>> v(n);
vector<int> f(m);
for (auto &[x, y]:v) cin>>y>>x;
for (auto &x:f) cin>>x;
sort(v.begin(), v.end());
sort(f.begin(), f.end());
int c=m-1;
for (int i=n-1; i>=0&&c>=0; i--) if (v[i].second<=f[c]) c--;
cout<<m-1-c;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
