#include "railroad.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define bit(a , b) (((a)>>(b))&1)
const int maxn = 2e5 + 20;
const int maxm = (1 << 16) + 20;
int s[maxn] , t[maxn] , n;
ll dp[maxm][20];
bool has[20];
long long plan_roller_coaster(vector<int> S, vector<int> T)
{
n = (int)S.size();
for(int i = 0; i < n; i++)
s[i] = S[i] , t[i] = T[i];
memset(dp , 63 , sizeof dp);
int hlp = (1 << n) , mn = 0;
for(int mask = 1; mask < hlp; mask++)
{
memset(has , 0 , sizeof has);
for(int i = 0; i < n; i++)
{
if(bit(mask , i))
{
for(int j = 0; j < n; j++)
if(i != j && s[j] <= t[i])
has[j] = 1;
if(mask == (1 << i))
{
dp[mask][i] = 0;
break;
}
for(int j = 0; j < n; j++)
if(bit(mask ^ (1 << i) , j))
dp[mask][i] = min(dp[mask][i] , dp[mask ^ (1 << i)][j] + max(0 , t[j] - s[i]));
}
}
int cnt = 0;
for(int j = 0; j < n; j++)
cnt += has[j];
cnt -= __builtin_popcount(mask);
mn = min(mn , cnt);
}
int ans = *min_element(dp[hlp - 1] , dp[hlp - 1] + n);
while(ans == 0 && mn < -1);
return ans;
}
