# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
529921 | kevin | Exhibition (JOI19_ho_t2) | C++17 | 108 ms | 9196 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;
#define ll long long
#define nl cout<<"\n"
#define all(x) x.begin(), x.end()
#define f first
#define s second
#define ca(v) for(auto i:v) cout<<i<<" ";
const int MOD = 1e9 + 7;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
if (fopen("input.in", "r")) freopen("input.in", "r", stdin);
int n, m; cin>>n>>m;
vector<pair<int, int>> ar;
for(int i=0; i<n; i++){
int x, v;
cin>>x>>v;
ar.push_back({x, v});
}
vector<int> sz(m);
for(int i=0; i<m; i++) cin>>sz[i];
sort(all(ar));
sort(all(sz));
multiset<pair<int, int>> ms;
for(auto p:ar) ms.insert({p.s, p.f});
int ans = 0;
int last = 2e9;
for(int i=m-1; i>=0; i--){
while(ar.size() && ar.back().f > sz[i]) {
auto it = ms.find({ar.back().s, ar.back().f});
if(it != ms.end()) ms.erase(it);
ar.pop_back();
}
while(ms.size() && ms.rbegin()->f > last) ms.erase(--ms.end());
if(ms.size()){
ans++;
last = ms.rbegin()->f;
ms.erase(--ms.end());
}
}
cout<<ans;
}
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... |