#include "railroad.h"
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <set>
#include <string>
#include <queue>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <deque>
#include <map>
#include <chrono>
#include <random>
#include <bitset>
#include <tuple>
#define SZ(x) int(x.size())
#define FR(i,a,b) for(int i=(a);i<(b);++i)
#define FOR(i,n) FR(i,0,n)
#define FAST ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define A first
#define B second
#define mp(a,b) make_pair(a,b)
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef unsigned __int128 U128;
typedef __int128 I128;
typedef std::pair<int,int> PII;
typedef std::pair<LL,LL> PLL;
using namespace std;
LL plan_roller_coaster(vector<int> s, vector<int> t){
int n=SZ(s), sm=0;
FOR(i,n) if (t[i]<t[sm]) sm=i;
vector<PII> a;
a.reserve(n-1);
FOR(i,n) if (i!=sm) a.push_back(mp(s[i],t[i]));
sort(a.begin(),a.end());
int cur=t[sm];
set<int> can;
FOR(i,n){
if (a[i].A>=cur){
can.insert(a[i].B);
continue;
}
if (can.empty()) return 1;
cur=*can.begin();
can.erase(can.begin());
}
return 0;
}
