Entrepreneur

n, t = input().split()
t = int(t)
n = int(n)

from math import floor

times = input().split()
efficiencies = [0]*n
counts = [0]*n
for i in range(n):
    times[i] = int(times[i])
    efficiencies[i] = 1/times[i]

sum_ei = sum(efficiencies)
t_div_sum_ei = t/sum_ei
for i in range(n):
    counts[i] = floor( t_div_sum_ei*efficiencies[i] )

n_already_in = sum(counts)
# print(counts, "already : ", n_already_in, "and rest : ", t-n_already_in)
for i in range(t-n_already_in):
    # find min array
    min_new_time, index = (counts[0] +1)* times[0], 0
    for k in range(1,n):
        new_time = (counts[k] +1)* times[k]
        if new_time < min_new_time:
            min_new_time = new_time
            index = k

    # put one there
    counts[index] += 1

# print(counts) 
final_times = [0]*n
min_final = times[0] * counts[0]
for i in range(n):
    final_times[i] = times[i] * counts[i]
    # print(final_times[i])
    if final_times[i] > min_final:
        min_final = final_times[i]

print(min_final)

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