N5jNqC - Online C++ Compiler & Debugging Tool

#include<bits/stdc++.h>
#define TIME (1.0* clock()/CLOCKS_PER_SEC)
#define pb push_back
#define eb emplace_back
#define id1 (id<<1)
#define id2 (id<<1)|1
#define ll long long
#define ii pair<int,int>
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vl vector<long long>
#define vll vector <pair<ll,ll>>
#define li pair<long long,int>
#define vil vector <pair<int,ll>>
#define db double
#define ff first
#define ss second
#define lb lower_bound
#define ub upper_bound
#define FOR(i, a, b) for (int i = (a); i <=(b); i++)
#define F0R(i, a) FOR(i, 0, a-1)
#define ROF(i, a, b) for (int i = (b); i >= (a); i--)
#define R0F(i, a) ROF(i, 0, a-1)
#define rep(a) F0R(_, a)
#define each(a, x) for (auto &a : x)
#define ALL(x) (x).begin(),(x).end()
#define pq priority_queue <li, vector <li>, greater <li>>
using namespace std;
const int maxn=1e6;
//const int MOD=1e9+7;
//const int MOD=998244353;
//const int dx[4]{1, 0, -1, 0}, dy[4]{0, 1, 0, -1};
int n;

void solve(){
    cin >> n;
    vl a(n);
    ll sum = 0, mn = 1e18, mx = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        sum += a[i];
        mn = min(mn, a[i]);
        mx = max(mx, a[i]);
    }
    if (n == 1) {
        cout << 0 << "\n";
    } else if (n == 2) {
        cout << max(a[0], a[1]) << "\n";
    } else {
        cout << sum - mn << "\n";
    }
}

signed main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);cout.tie(NULL);
  if (fopen("TASK.INP", "r")){
      freopen("TASK.INP", "r", stdin);
      freopen("TASK.OUT", "w", stdout);
  }
  int ntest;
  ntest=1;
  cin>>ntest;

  for(int i=1;i<=ntest;i++) solve();
  cerr<<"\n"<<"Time elapsed "<<TIME<<"s.\n";
  return 0;
}