https://codeforces.com/contest/1183/problem/F

题解：排序+朴素

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
#define endl "\n"
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=200000+10;
const int M=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,p,l,r,u,v;
int ans,cnt,flag,temp,sum;
int a[N];
char str;
struct node{};
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    //ios::sync_with_stdio(false);
    //cin.tie(0);
    //cout.tie(0);
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        for(int i=0;i<n;i++)scanf("%d",&a[i]);
        sort(a,a+n,greater<int>());
        n = unique(a,a+n) - a;
        ans = 0;
        for (int i = 0;i < n;++i){
            int x = a[i];
            ans = max(ans,x);
            bool flag = 0;
            if (i == n-1) break;
            for (int j = i+1;j < n;++j){
                if (a[i] % a[j] == 0) continue;
                int y = a[j];
                ans = max(ans,y+x);
                if (j == n-1) break;
                for (int k = j+1;k < n;++k){
                    if (a[i]%a[k] == 0 || a[j] % a[k] == 0) continue;
                    ans = max(ans,x+y+a[k]);
                    flag = 1;
                    break;
                }
                if (flag == 1) break;
            }
        }
        printf("%d\n",ans);
    }

#ifdef DEBUG
	printf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC);
#endif
    //cout << "Hello world!" << endl;
    return 0;
}