B_Interesting_Sum.cpp

#include <bits/stdc++.h>
using namespace std;
 
// Macros
#define ll long long
#define vb vector<bool>
#define vl vector<long long>
#define vi vector<int>
#define vvl vector<vector<long long>>
#define vpl vector<pair<long long, long long>>
#define ml map<long long, long long>
#define mpl map<pair<long long, long>, pair<long long, long long>>
#define pl pair<long long, long long>
#define sort(x) sort(x.begin(), x.end())
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define all(x) x.begin(),x.end()
#define seea(a,x,y) for(int i=x;i<y;i++){cin>>a[i];}
#define seev(v,n) for(int i=0;i<n;i++){int x; cin>>x; v.push_back(x);}
#define sees(s,n) for(int i=0;i<n;i++){int x; cin>>x; s.insert(x);}
#define rep(i,a,b) for(int i=a; i<b; i++) 
#define even(x)  x % 2 == 0 
#define odd(x)  x % 2 != 0 


// Constants
const long long MOD = 1e9 + 7;
const long N = 1e5 + 7;
const long long llmax = LONG_LONG_MAX;

void solve()
{
    int n;
    cin >> n;
    vi v(n);
    rep(i,0,n)
    {
        cin >> v[i];

    }
    // int a = *max_element(all(v));
    // int b = *min_element(all(v));
    int p = INT_MIN, q = INT_MAX, a = 0, b = 0;
    rep(i,0,n)
    {
        if(v[i] > p)
        {
            p = v[i];
            a = i;
        }
        if(v[i] < q)
        {
            q = v[i];
            b = i;
        }
    }
    int ans = p-q;
    v[a] = INT_MIN;
    int g = *max_element(all(v));
    v[a] = p;
    v[b] = INT_MAX;
    int h = *min_element(all(v));
    ans += g-h;
    cout << ans << endl;

}

int main()
{
    int t;
    cin >> t;

    while(t--)
    {
        solve();
    }



    return 0;
}