CF1661A

要差最小，肯定是大的两个相减，再加上小的两个相减，就达到最小了

#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;

typedef long long ll;

int a[50], b[50];

int main() {
    int T; scanf ("%d", &T);
    while (T --) {
        int n; scanf ("%d", &n);
        for (int i = 1; i <= n; ++i) scanf ("%d", &a[i]);
        for (int i = 1; i <= n; ++i) scanf ("%d", &b[i]);
        for (int i = 1; i <= n; ++i) if (a[i] > b[i]) swap (a[i], b[i]);
        ll ans = 0;
        for (int i = 2; i <= n; ++i) {
            ans += abs (a[i] - a[i - 1]) + abs (b[i] - b[i - 1]);
        }
        printf ("%lld\n", ans);
    }
    return 0;
}