rt 提交记录

#include<iostream>
#include<algorithm>
#define int long long
using namespace std;
int n,a[200001],T,b,e,ans;
void go_work()
{
    cin >> n;
    for(int i = 1;i <= n;i++) cin >> a[i];
    b = a[1],e = a[n],ans = 0;
    sort(a + 1,a + n + 1);
    while(b < e)
    {
        if(ans > n)
        {
            cout << -1 << endl;
            return;
        }
        ans++;
        b = a[upper_bound(a + 1,a + n + 1,b * 2) - a - 1];
    }
    cout << ans + 1 << endl;
}
signed main()
{
    cin >> T;
    while(T--) go_work();
    return 0;
}