#include "wiring.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#include <set>
typedef long long llong;
const int MAXN = 1000 + 10;
const llong INF = 1e15;
int n, m;
llong r[MAXN];
llong b[MAXN];
llong val[MAXN];
bool bl[MAXN][MAXN];
llong dp[MAXN][MAXN];
llong f(int lPtr, int rPtr)
{
if (lPtr == n+1 && rPtr == m+1) return 0;
if (lPtr == n+1 || rPtr == m+1) return INF;
if (bl[lPtr][rPtr]) return dp[lPtr][rPtr];
bl[lPtr][rPtr] = true;
dp[lPtr][rPtr] = INF;
dp[lPtr][rPtr] = std::min(dp[lPtr][rPtr], f(lPtr, rPtr + 1) + val[rPtr]);
dp[lPtr][rPtr] = std::min(dp[lPtr][rPtr], f(lPtr + 1, rPtr + 1) + llabs(r[lPtr] - b[rPtr]));
return dp[lPtr][rPtr];
}
long long min_total_length(std::vector <int> R, std::vector <int> B)
{
if (R.size() > B.size()) std::swap(R, B);
n = R.size();
m = B.size();
for (int i = 1 ; i <= n ; ++i)
{
r[i] = R[i-1];
}
for (int i = 1 ; i <= m ; ++i)
{
b[i] = B[i-1];
}
int ptr = 1;
for (int i = 1 ; i <= m ; ++i)
{
while (ptr + 1 <= m && b[ptr + 1] <= r[i]) ptr++;
val[i] = abs(r[i] - b[ptr]);
if (ptr + 1 <= m) val[i] = std::min(val[i], llabs(r[i] - b[ptr + 1]));
}
return f(1, 1);
}
