【題解】Green Judge g069: D.流水不腐

#include <iostream>
using namespace std;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    int T, N;
    cin >> T;
    while (T--) {
        cin >> N;
        int id[N], w[N];
        for (int i = 0; i < N; i++) {
            cin >> id[i];
        }
        for (int i = 0; i < N; i++) {
            cin >> w[i];
        }
        long long ans = 0;
        for (int i = N - 2; i >= 0; i--) {
            for (int j = 0; j <= i; j++) {
                if (id[j] > id[j+1]) {
                    ans += w[j] + w[j+1];
                    swap(id[j], id[j+1]);
                    swap(w[j], w[j+1]);
                }
            }
        }
        cout << ans << "\n";
    }
    return 0;
}