2153.cpp

#include <bits/stdc++.h>
using namespace std;
template<typename T>
void _debug(const char* name, T&& value) {
    cerr << name << " = " << value << endl;
}
template<typename T, typename... Args>
 void _debug(const char* names, T&& value, Args&&... args) {
    const char* comma = strchr(names, ',');
    cerr.write(names, comma - names) << " = " << value << " | ";
    _debug(comma + 1, args...);
}


#define debug(...) _debug(#__VA_ARGS__, __VA_ARGS__)
#define ll long long
#define REP(i,n) for(int i=0; i<n; i++)
#define RREP(i,n) for(int i=n-1; i>= 0; i--)
#define mod 1000000007

void solve()
{
    int n; cin >> n;
    set<int> sticklen;
    map<int, int> freq;
    REP(i, n){
        int temp;
        cin >> temp;
        sticklen.insert(temp);
        freq[temp]++;        
    }
    ll sum = 0; int count = 0;
    vector<ll> odds;
    for(auto it = sticklen.rbegin(); it != sticklen.rend(); ++it){
        if(freq[*it]%2){
            odds.push_back(*it*freq[*it]);
        }
        else
            sum += *it*freq[*it];
            count+=freq[*it];
    }
    sort(odds.begin(), odds.end());
    reverse(odds.begin(), odds.end());
    if(odds.size() == 1) odds.push_back(0);
    ll odddiff = odds[0] - odds[1];
    int i = 1;
    while(odddiff > sum || i != odds.size()-1){
        odddiff = odds[i] - odds[i + 1];
        i++;
    }
    if(odddiff > sum){
        if(count < 3) cout
    }

}

int main() {
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    ll test=1;
    cin>>test;
    while(test--)
    {
        solve();
    }
    return 0;
}