# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
707199 | Alihan_8 | Exhibition (JOI19_ho_t2) | C++17 | 69 ms | 5580 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>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m; cin >> n >> m;
vector <pair<int,int>> p(n);
for ( auto &[r, l]: p ) cin >> l >> r;
vector <int> C(m);
for ( auto &i: C ) cin >> i;
sort(all(C)); sort(all(p));
for ( auto &[l, r]: p ) swap(l, r);
auto ok = [&](int X){
int it = 0;
for ( int i = m-X; i < m; i++ ){
while ( it < n and p[it].first > C[i] ) it++;
if ( it == n ) return false;
it++;
}
return true;
};
int l = 0, r = min(m+1, n+1);
while ( l+1 < r ){
int md = (l+r) >> 1;
if ( ok(md) ) l = md;
else r = md;
}
cout << l;
cout << '\n';
}
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... |