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



void solve(){
    int n;
    cin >> n;
    vector<long long>a(n);
    for(auto &x : a)cin >> x;
    sort(a.begin(), a.end(), greater());
    int l = 1, r = n;

    auto check = [&](int mid){
        long long space = 0;
        for(int i = 0; i < mid; i++)space += (a[i]/2);
        for(int i = mid; i < n; i++){
            if(space < a[i])return false;
            space -= a[i];
            space += a[i]/2;
        }
        return true;
    };
    while(l <= r){
        int mid = (l + r)/2;
        if(check(mid))r = mid - 1;
        else l = mid + 1;
    }
    cout << l << '\n';
}


int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin >> t;
    while(t--)solve();
    return 0;
}