POJCrossing River

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm> 
using namespace std;
typedef long long ll;
ll n,x;
const ll N=1e7+520;
ll a[N],t;
int main()
{
    scanf("%lld",&t);
    while(t--)
    {
        x=0;
        scanf("%lld",&n);
        for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
        sort(a+1,a+1+n);
        ll k=1;
        while(n>3)
        {
            x+=min(2*a[1]+a[n-1]+a[n],2*a[2]+a[n]+a[1]);
            n-=2; 
        }
        if(n==3) 
        {
            x+=(a[1]+a[2]+a[3]); 
        }
        if(n==2)
        {
            x+=a[2];
        }
        if(n==1)
        {
            x+=a[1];
        }
        cout<<x<<‘\n‘;
    } 
    return 0;
}