CUBE: Worker

#include <bits/stdc++.h>

using namespace std;
using lli = long long;
const int N = 1e3 + 10;
using pi = pair <int, int>;
using pii = pair <int, pi>;
vector <pii> Path;
int parent[N], T[N], B[N];
int n;

int root(int u){ return parent[u] = parent[u] == u ? u: root(parent[u]);}

int mrg(int u, int v){
    u = root(u);
    v = root(v);
    parent[v] = u;
}

int main(){

    int n;
    scanf("%d", &n);

    for(int i=0;i<=n;i++)
        parent[i] = i;

    for(int i=1;i<=n;i++){
        scanf("%d", &T[i]);
        Path.push_back({ T[i], {0, i} });
    }

    for(int i=1;i<=n;i++)
        scanf("%d", &B[i]);

    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            Path.push_back({ B[i] + B[j], {i, j} });
        }
    }

    sort(Path.begin(), Path.end());

    lli ans = 0;
    for(auto wuv: Path){
        int u = wuv.second.first;
        int v = wuv.second.second;
        int w = wuv.first;
        if(root(u) == root(v)) continue;
        mrg(u, v);
        ans += w;
    }

    printf("%lld", ans);

    return 0;
}