1077E - Thematic Contests - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
#define int               long long
#define pb                push_back
#define ppb               pop_back
#define pf                push_front
#define ppf               pop_front
#define all(x)            (x).begin(),(x).end()
#define fr                first
#define sc                second
#define rep(i,a,b)        for(int i=a;i<b;i++)
#define mem1(a)           memset(a,-1,sizeof(a))
#define mem0(a)           memset(a,0,sizeof(a))
#define ppc               __builtin_popcount
#define ppcll             __builtin_popcountll
#define debug(x)  cout<<(x)<<'\n';


const long long INF=1e18;
const int32_t M=1e9+7;
const int32_t MM=998244353;

const int N=0;


void solve(){
   

int n;
cin>>n;
int a[n];
rep(i,0,n) cin>>a[i];
map<int,int> m;
for(int i=0;i<n;i++)
m[a[i]]++;

vector<int> v;
for(auto it=m.begin();it!=m.end();it++)
v.pb(it->sc);

sort(all(v));
int ans=0;
for(int i=1;i<=n;i++)
{

int curr=i;
int  temp=0;
int j=0;
for(;j!=v.size();)
{

auto it=lower_bound(v.begin()+j,v.end(),curr);
if(it==v.end()) {
    break;
}
temp+=curr;
curr=curr*2;
j=it-v.begin()+1;

}


ans=max(ans,temp);

}
cout<<ans<<'\n';
    
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);

    int t=1;

    while(t--) solve();
    return 0;
}