#include <bits/stdc++.h>
#include "railroad.h"
//#include "grader.cpp"
using namespace std ;
vector<int>a , b ;
int n ;
vector< pair<int , int> >vp ;
bool solve(pair<int , int>p)
{
set< pair<int , int> >s ;
set< pair<int , int> >::iterator it ;
for(int i = 0 ; i < n ; ++i)
s.insert(vp[i]) ;
for(int i = 0 ; i < n-1 ; ++i)
{
s.erase(p) ;
it = s.lower_bound({p.second , -1}) ;
if(it == s.end())
return 0 ;
p = *it ;
}
return 1 ;
}
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
n = (int) s.size();
a = s , b = t ;
for(int i = 0 ; i < n ; ++i)
vp.push_back({a[i] , b[i]}) ;
sort(vp.begin() , vp.end()) ;
for(int i = 0 ; i < 100 ; ++i)
{
if(solve(vp[i]) == 1)
return 0 ;
}
return 1 ;
}
