Obscure

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>

using namespace std;

class TheShuttles{
public:
	int getLeastCost(vector<int> cnt,int baseCost,int seatCost){
		int max_bus=0;
		
		for(int i=0;i<cnt.size();i++){
			if(i==0)max_bus = cnt[i];
			else max_bus = std::max(max_bus,cnt[i]);
		}
		int mc=0;
		
		for(int i=1;i<=max_bus;i++){
			int cost = 0;	
			for(int j=0; j<cnt.size(); j++){
				cost += (int)(1.*cnt[j]/i+0.99) * baseCost + i * seatCost * (int)(1.*cnt[j]/i+0.99);
			}
			if(i==1) mc = cost;
			else mc = std::min(mc,cost);
		}
		return mc;
	}
};