Codeforces-SolutionsA/Codes/1665 B - Array Cloning Technique/1665B.cpp
ShazidMahsrafi 1216a6efe5 added 665B
2024-07-12 23:12:55 +06:00

64 lines
1.2 KiB
C++

#include <bits/stdc++.h>
using namespace std;
#ifdef ONLINE_JUDGE
#define dbg(...)
#else
#include "Assets/debug.h"
#endif
#define int long long
#define ll long long
#define endl '\n'
#define ff first
#define ss second
#define ins insert
#define pb push_back
#define ppb pop_back
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define rep(i,a,b) for(int i=a; i<b; ++i)
#define rrep(i,a,b) for(int i=a; i>=b; --i)
#define yn(f) f? cout<<"YES\n":cout<<"NO\n"
#define FAST (ios_base::sync_with_stdio(false), cin.tie(nullptr));
ll pow(ll x,ll y,ll m=1e9+7) {ll ans=1;x%=m;while(y){if(y&1)ans=(ans*x)%m;x=(x*x)%m;y>>=1;}return ans;}
void solve()
{
int n;
cin>>n;
map<int,int>m;
rep(i,0,n)
{
int x;
cin>>x;
m[x]++;
}
if(m.size()==1)
{
cout<<0<<endl;
return;
}
int ct=0;
for(auto [x,y]:m)
ct=max(ct,y);
int r = n-ct;
int ans=0;
while(ct<n)
{
ans += min(r,ct)+1;
r -= ct;
ct *= 2;
}
cout<<ans<<endl;
}
signed main()
{
FAST;
int TCS = 1;
cin >> TCS;
for (int TC = 1; TC <= TCS; ++TC)
{
// cout<<"Case "<<TC<<": ";
solve();
}
}