1914D.cpp

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

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(0);

    int t;
    cin >> t;
    while (t--)
    {
        int n;
        cin >> n;
        vector<pair<int, int>> a(n), b(n), c(n);

        for (int i = 0; i < n; i++) {
            int temp;
            cin >> temp;
            a[i] = {temp, i};
        }
        for (int i = 0; i < n; i++) {
            int temp;
            cin >> temp;
            b[i] = {temp, i};
        }
        for (int i = 0; i < n; i++) {
            int temp;
            cin >> temp;
            c[i] = {temp, i};
        }

        sort(a.begin(), a.end(), greater<>());
        sort(b.begin(), b.end(), greater<>());
        sort(c.begin(), c.end(), greater<>());

        int maxi = 0;
        for (int i = 0; i < 3; i++) {
            for (int j = 0; j < 3; j++) {
                for (int k = 0; k < 3; k++) {
                    int idx1 = a[i].second;
                    int idx2 = b[j].second;
                    int idx3 = c[k].second;
                    if (idx1 != idx2 && idx2 != idx3 && idx1 != idx3) {
                        int sum = a[i].first + b[j].first + c[k].first;
                        maxi = max(maxi, sum);
                    }
                }
            }
        }

        cout << maxi << '\n';
    }

    return 0;
}