1879B. Chips on the Board

constructive algorithms, greedy, 900, https://codeforces.com/problemset/problem/1879/B

#include <bits/stdc++.h>
using namespace std;

const int N = 300005, inf = 1e9;
int T, n, a, b, min1, min2;
long long sum1, sum2;

int main() {
    scanf("%d", &T);
    while (T--) {
        sum1 = sum2 = 0;
        min1 = min2 = inf;
        scanf("%d", &n);
        for (int i = 1; i <= n; i++) {
            scanf("%d", &a);
            sum1 += 1ll * a;
            min1 = min(min1, a);
        }
        for (int i = 1; i <= n; i++) {
            scanf("%d", &b);
            sum2 += 1ll * b;
            min2 = min(min2, b);
        }
        printf("%lld\n", min(1ll * min1 * n + sum2, 1ll * min2 * n + sum1));
    }
    return 0;
}