#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;
long long N, M, A[200009], B[200009], dp[2009][2009];
long long solve_subtask1() {
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= M; j++) dp[i][j] = (1LL << 60);
}
dp[0][0] = 0;
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= M; j++) {
dp[i + 1][j + 1] = min(dp[i + 1][j + 1], dp[i][j] + abs(A[i] - B[j]));
if (j >= 1) dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + abs(A[i] - B[j - 1]));
if (i >= 1) dp[i][j + 1] = min(dp[i][j + 1], dp[i][j] + abs(A[i - 1] - B[j]));
}
}
return dp[N][M];
}
long long solve_subtask2() {
long long sum = 0;
for (int i = 0; i < N - 1; i++) sum += 1LL * (i + 1LL) * (A[i + 1] - A[i]);
for (int i = 0; i < M - 1; i++) sum += 1LL * (M - i - 1LL) * (B[i + 1] - B[i]);
sum += 1LL * max(N, M) * (B[0] - A[N - 1]);
return sum;
}
long long min_total_length(vector<int> r, vector<int> b) {
N = r.size(); M = b.size();
for (int i = 0; i < N; i++) A[i] = r[i];
for (int i = 0; i < M; i++) B[i] = b[i];
if (N <= 2000 && M <= 2000) return solve_subtask1();
return solve_subtask2();
}
