| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 547086 | Hanksburger | Exhibition (JOI19_ho_t2) | C++17 | 1 ms | 212 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;
pair<int, int> a[100005];
vector<int> vec;
int b[100005];
bool cmp(pair<int, int> x, pair<int, int> y)
{
return (x.second<y.second);
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m, index=1;
cin >> n >> m;
for (int i=1; i<=n; i++)
cin >> a[i].first >> a[i].second;
for (int i=1; i<=m; i++)
cin >> b[i];
sort(a+1, a+n+1);
sort(b+1, b+m+1);
for (int i=1; i<=m; i++)
sort(upper_bound(a+1, a+n+1, make_pair(b[i-1], 1000000000)), upper_bound(a+1, a+n+1, make_pair(b[i], 1000000000)), cmp);
for (int i=1; i<=m; i++)
{
if (index<=n && a[index].first<=b[i])
{
int x=upper_bound(vec.begin(), vec.end(), a[index].second)-vec.begin();
if (x==vec.size())
vec.push_back(a[index].second);
else
vec[x]=a[index].second;
index++;
}
}
cout << vec.size();
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... | ||||
