#include<iostream> #include<algorithm> #include<cmath> using namespace std; int n, m, ans = 0; double a[610], cnt = 0; int main(){ cin >> m; for(int j = 0; j < m; j++){ cin >> n; for(int i = 0; i < n; i++){ cin >> a[i]; a[i] = 2 * (sqrt(pow(a[i], 2) - 1)); } sort(a, a + n, greater<double>{}); ans = 0; cnt = 0; for(int i = 0; i < n; i++){ cnt += a[i], ans++; if(cnt >= 20) break; } cout << ans << endl; } }