#include "railroad.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
using namespace std;
typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define INF (1LL<<60)
#define INF2 1145141919
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define index(x, y) (int)(lower_bound(all(x), y) - x.begin())
#define pb push_back
#define _1 first
#define _2 second
int N;
int S[200000], T[200000];
long long dp[1<<16][16];
int E[400001];
bool f() {
vector<int> xs;
rep(i, N) xs.pb(S[i]), xs.pb(T[i]);
sort(all(xs)); uniq(xs);
rep(i, N) E[index(xs, S[i])]++, E[index(xs, T[i])]--;
rep(i, xs.size()) E[i+1] += E[i];
//cout<<"{"; rep(i, xs.size()) cout << E[i]<<",";cout<<"}\n";
rep(i, xs.size()) if (E[i] > 1) return false;
return true;
}
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
N = s.size();
rep(i, N) S[i] = s[i], T[i] = t[i];
//if( false){
if (N <= 16) {
rep(i, 1<<N) rep(j, N) dp[i][j] = INF;
rep(i, N) dp[1<<i][i] = 0;
rep(b, 1<<N) {
rep(last, N) {
if (dp[b][last] == INF) continue;
rep(t, N) if (((b>>t)&1) == 0) {
dp[b|(1<<t)][t] = min(dp[b|(1<<t)][t], dp[b][last] + max(T[last]-S[t], 0));
}
}
}
long long m = INF;
rep(i, N) m = min(m, dp[(1<<N)-1][i]);
return m;
}
else {
return !f();
}
}
