# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
529944 | scottchou | Exhibition (JOI19_ho_t2) | C++17 | 298 ms | 5376 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<iostream>
#include<algorithm>
#include<queue>
using namespace std;
int const N = 1e5 + 5;
typedef pair<int, int> pii;
pii pic[N];
int c[N], n, m;
bool check(int x){
int idx = 0;
priority_queue<int, vector<int>, greater<int> > pq;
int last = 0;
for(int i = x - 1; i >= 0; i--){
while(idx < n && pic[idx].first <= c[i]){
if(pic[idx].second >= last)
pq.push(pic[idx].second);
idx++;
}
if(pq.empty()){
return 0;
}
last = pq.top();
pq.pop();
}
return 1;
}
int main(){
cin >> n >> m;
for(int i = 0; i < n; i++){
cin >> pic[i].first >> pic[i].second;
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... |