public int getLeastCost(int[] cnt, int baseCost, int seatCost) {
		int min = Integer.MAX_VALUE;
		for (int i = 1; i <= 100; i++) {
			int sum = 0;
			for (int count : cnt) {
				int n = count / i;
				if (0 < count % i) {
					n++;
				}
				int cost = n * (baseCost + seatCost * i);
				sum += cost;
			}
			min = Math.min(min, sum);
		}
		return min;
	}