#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) int(a.size())
#define f(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) f(i, 0, a)
#define tv(a, x) for (auto& a : x)
#define DUZO 1000000000000000000LL
#define en "\n"
#define cn continue
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vii = vector<pii>;
ll min_total_length(vi r, vi b) {
int n = sz(r);
int m = sz(b);
vector<vector<ll>> dp(n+ 1, vector<ll>(m + 1));
dp[0][0] = 0;
f(i, 1, n + 1) dp[i][0] = DUZO;
f(i, 1, m + 1) dp[0][i] = DUZO;
f(i, 1, n + 1) {
f(j, 1,m + 1) {
dp[i][j] = abs(r[i - 1] - b[j - 1]) + min(dp[i - 1][j - 1], min(dp[i-1][j], dp[i][j-1]));
}
}
return dp.back().back();
}
