#include <bits/stdc++.h> #define L(i, j, k) for(int i = (j); i <= (k); i++) #define R(i, j, k) for(int i = (j); i >= (k); i--) #define ll long long #define sz(a) ((int) a.size()) #define all(a) a.begin(), a.end() #define vi vector<int> #define pb emplace_back #define me(a, x) memset(a, x, sizeof(a)) #define fst first #define snd second #define ii pair<int, int> using namespace std; long long min_total_length(std::vector<int> r, std::vector<int> b) { int n=sz(r),m=sz(b); ll ans=0; L(i,0,min(m-1,n-1)){ ans+=b[i]-r[i]; } L(i,n,m-1){ ans+=b[i]-r[n-1]; } L(i,m,n-1){ ans+=b[0]-r[i]; } return ans; }