hackerearth. CFRESH. GO CSK

test.cpp

// divide by 2 the maximum element of array, what is the minimum maximum element you can get at end.
// question link : https://www.hackerearth.com/problem/algorithm/beautiful-division/

void solve(){
	int n,k; cin>>n>>k;
	bool all_zero=0;
	mpi mp; f(i,0,n){
		int x; cin>>x; ++mp[x];
		if(x!=0) all_zero=1;
	}
	if(!all_zero){
		cout<<"0\n";
		return ;
	}
	while(1){
		auto ip = mp.end();
		--ip;
		pii it=*ip;
		mp.erase(ip);
		if(it.ff<=1) break;
		int fre=it.ss; 
		int num=it.ff;
		if(num&1){
			mp[num/2]+=fre;
			mp[num/2 + 1]+=fre;
		}else mp[num/2]+=fre*2;
		k-=fre;
		if(k<0) {
			cout<<num<<"\n";
			return ;
		}
	}
	cout<<"1"<<endl;
}