#include<bits/stdc++.h>
#include"railroad.h"
#define mp make_pair
#define mt make_tuple
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
using namespace std;
template <typename T>
using matrix = vector<vector<T>>;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll INFL = (1LL<<62)-1;
const int INF = (1<<30)-1;
const double EPS = 1e-7;
const int MOD = 1e9 + 7;
const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
const int MAXN = 1e6+1;
long long elaborado(std::vector<int> s, std::vector<int> t) {
int n = s.size();
set<int> vals;
vals.insert(0);
vals.insert(INF);
for(int i = 0; i < n; i++){
vals.insert(s[i]);
vals.insert(t[i]);
}
map<int,int> dic;
for(int i : vals)
dic[i] = dic.size();
int m = dic.rbegin()->ss;
vector<int> check(m+1);
vector<int> hasedge(m+2);
vector<int> delta(m+2);
matrix<int> g(m+1);
for(int i = 0; i < n; i++){
int u = dic[s[i]], v = dic[t[i]];
delta[u]--;
delta[v]++;
g[u].push_back(v);
}
int cur = 1;
for(int i = 0; i < m; i++){
cur+=delta[i];
if(cur){
g[i].push_back(i+1);
}
}
auto dfs =[&](int id, auto dfs)->void{
check[id] = 1;
for(int i : g[id]){
if(!check[i]){
dfs(i,dfs);
}
}
};
dfs(0,dfs);
return accumulate(all(check),0) != m+1;
}
ll plan_roller_coaster(vector<int> s, vector<int>t){
if(s.size() > 16)
return elaborado(s,t);
int n = s.size();
matrix<ll> dp(1<<n,vector<ll>(n,INFL));
fill(all(dp[0]),0);
for(int i = 0; i < n; i++)
dp[1<<i][i] = 0;
for(int i = 0; i < (1<<n); i++){
for(int j = 0; j < n; j++){
for(int k = 0; k < n; k++){
if(!((1<<k)&i))
continue;
dp[i][k] = min(dp[i][k],dp[i^(1<<k)][j]+max(0,t[j]-s[k]));
}
}
}
return *min_element(all(dp[(1<<n)-1]));
}
