70 pts 求 hack

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

const int N = 1e6 + 5;
int n;

bool check(int x){
	return ((x & (x + 1)) == 0);
}

void solve(){
	cin >> n;
	int c1 = 0, c2 = 0, ans = 0;
	for(int i = 1, x; i <= n; ++ i){
		cin >> x;
		if(x == 1) ++ c1;
		else if(x == 0) continue;
		else if(check(x)) ++ c2, ans += __lg(x);
		else ans += __lg(x);
//		cout << "?" << ans << "\n";
	}
//	cout << "!" << c1 << " " << c2 << "\n";
	ans += min(c1, c2);
	cout << ans << "\n";
}

signed main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	
	int c, T;
	cin >> c >> T;
	while(T --)
		solve();
	
	return 0;
}