Entrepreneur

import math
n, t = input().split()

n = int(n)
t = int(t)

ks = input().split()
ks = [int(k) for k in ks]





estimated = sum([(1/k) for k in ks])

lowest_time = math.ceil(t / estimated)


cars_done = 0
cost_one_more = []



for k in ks:
    machine_done = lowest_time // k
    time_one_more = (machine_done + 1) * k

    cars_done += machine_done
    cost_one_more.append((time_one_more, k))
    # for i in range(100):
    #     cost_one_more.append(cost + i * k)


cost_one_more.sort()

needed = t - cars_done
total_time = lowest_time


for i in range(needed):
    best_time, k = cost_one_more[0]
    total_time = max(total_time, best_time)
    cost_one_more[0] = (best_time + k, k)
    cost_one_more.sort()



# print(lowest_time, needed, cost_one_more)

print(total_time)

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED