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 "railroad.h"
#include <bits/stdc++.h>
using namespace std;
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
int n = (int) s.size();
vector<pair<int,int>> st;
for(int i=0;i<n;i++){
st.push_back({s[i],t[i]});
}
sort(st.begin(),st.end(), [&](pair<int,int> x,pair<int,int> y){if(x.first == y.first)return (x.second>y.second);return (x.first<y.first);});
for(auto i:st){cerr<<i.first<<' '<<i.second<<endl;}
long long sp=0;
for(int i=0;i<n;i++){
if(st[i].first>sp)return 1;
else sp+=st[i].second;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |