Educational Codeforces Round 121 (Rated for Div. 2) D. Martial Arts Tournament (巧妙的前缀处理)

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
// #define int long long 
const int N=2e5+10;
const int mod=1e9+7;
int t,n,a[N],pre1[N],pre2[N],cnt[N];
void solve(){
	for(int i=0;i<=n;i++) cnt[i]=0;
	for(int i=1;i<=n;i++) cnt[a[i]]++;
	int now=0;
	for(int i=1;i<=n;i++){
		 for(int j=now;j<now+cnt[i];j++) pre1[j]=now;
		 now+=cnt[i];
	}
	// for(int i=1;i<=n;i++) cout<<pre1[i]<<" ";cout<<endl;
	now=0;
	for(int i=n;i>=1;i--){
		 for(int j=now;j<now+cnt[i];j++) pre2[j]=now;
		 now+=cnt[i];
	}
	int res=1e9;
	for(int i=1;i<=n;i=i<<1){
		for(int j=1;j<=n;j=j<<1){
			int tp=pre1[i]+pre2[j],mid=1;
			while(mid<n-tp) mid<<=1;
			// cout<<i<<" "<<j<<" "<<mid<<" "<<tp<<endl;
			res=min(res,i+j+mid-n);
		}
	}
	cout<<res<<endl;
}
int main(){
	scanf("%d",&t);
	while(t--){
		scanf("%d",&n);for(int i=1;i<=n;i++)scanf("%d",&a[i]);
		solve();
		
	}
}