# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
547089 | Hanksburger | Exhibition (JOI19_ho_t2) | C++17 | 0 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;
multiset<int> s;
int b[100005];
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++)
{
while (index<=n && a[index].first<=b[i])
{
s.insert(a[index].second);
index++;
}
if (s.empty())
continue;
int x=(*s.begin());
int pos=upper_bound(vec.begin(), vec.end(), x)-vec.begin();
if (pos==vec.size())
vec.push_back(x);
else
{
s.insert(vec[pos]);
vec[pos]=x;
}
s.erase(x);
}
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... |