#include<bits/stdc++.h>
using namespace std;
#define ll long long

ll a[200005];

int main() {
    //ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll t;
    cin >> t;

    while (t--)
    {
        ll n;
        cin >> n;

        for (ll i = 1; i <= n; i++) cin >> a[i];

        sort(a + 1, a + 1 + n);

        ll l = 1, r = n, sum = 0, ans = 0;
        while (l < r)
        {
            sum += a[l];
            if (sum >= a[r])
            {
                ans += a[r] + 1LL;
                a[l] = sum-a[r];
                sum=0;
                a[r] = 0;
                r--;

                if (r == l)
                {
                    cout << ans + a[l] / 2 + (ll)((a[l] / 2) != 0) + a[l] % 2 << '\n';
                    break;
                }
                if(!a[l]) l++;
            }
            else l++;
            if (r == l)
            {
                cout << ans + (sum + a[r]) / 2 + (ll)((sum + a[r]) / 2 != 0) + (sum + a[r]) % 2 << '\n';
                break;
            }
        }
    }
    return 0;
}