# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
384211 | kaplanbar | Untitled (POI11_tem) | C++14 | 0 ms | 0 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;
using ll = long long;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<pair<ll,ll>> v(n);
for(int i = 0; i < n; i++) {
cin >> v[i].first >> v[i].second;
}
int ans = 0;
int j = 0;
multiset<ll> s;
int ans = 0;
for(int i = 0; i < n; i++) {
j = max(j, i);
while(j < n && (s.empty() || v[j].second >= -(*s.begin()))) {
s.insert(-v[j].first);
j++;
}
ans = max(ans, j - i);
s.erase(s.find(-v[i].first));
}
cout << ans;
return 0;
}