#include<bits/stdc++.h>
#define MAXN 100007
using namespace std;
const long long inf=1e15;
int n,m;
int red[MAXN],blue[MAXN];
bool li[207][207];
long long dp[207][207],ans;
long long ff(int l,int r){
if(l==n and r==m)return abs(red[l]-blue[r]);
if(li[l][r])return dp[l][r];
li[l][r]=true;
dp[l][r]=inf;
if(l<n)dp[l][r]=min(dp[l][r],ff(l+1,r));
if(r<m)dp[l][r]=min(dp[l][r],ff(l,r+1));
if(l<n and r<m)dp[l][r]=min(dp[l][r],ff(l+1,r+1));
dp[l][r]+=abs(red[l]-blue[r]);
return dp[l][r];
}
long long min_total_length(vector<int> R,vector<int> B){
n=int(R.size()); m=int(B.size());
for(int i=1;i<=n;i++)red[i]=R[i-1];
for(int i=1;i<=m;i++)blue[i]=B[i-1];
if(n<=200 and m<=200){
return ff(1,1);
}else{
if(n<=m){
for(int i=1;i<=n;i++){
ans+=blue[i]-red[i];
}
for(int i=n+1;i<=m;i++){
ans+=blue[i]-red[n];
}
}else{
for(int i=m;i>=1;i--){
ans+=blue[i]-red[n-(m-i)];
}
for(int i=n-m;i>=1;i--){
ans+=blue[1]-red[i];
}
}
return ans;
}
}
/*
int main(){
cout<<min_total_length({1, 2, 3, 7}, {0, 4, 5, 9, 10})<<"\n";
}
*/
