Codeforces Round #781 (Div. 2) 1665B - Array Cloning Technique Solution

Problem Link:  https://codeforces.com/contest/1665/problem/B

 Solution in C++:

///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

///**********ALLAH IS ALMIGHTY************///

#include <bits/stdc++.h>

using namespace std;

int main()

{

    int   n,a,i,mx,ans,t,r;

    cin>>t;

    while(t--)

    {

        map<int,int>mp;

        mx=0;

        cin>>n;

        for(i=0; i<n; i++)

        {

            cin>>a;

            mp[a]++;

            mx=max(mx,mp[a]);

        }

        ans=n-mx;

        while(mx<n)

        {

            ans++;

            mx*=2;

        }

        cout<<ans<<endl;

    }

}