Entrepreneur

line1 = input().split()
n_machines = int(line1[0])
n_cars = int(line1[1])

machine_times = [int(elem) for elem in input().split()]

time_stack = [0]*n_machines
for i in range(n_cars):
    lowest_end_time = None
    next_machine = None
    for k in range(n_machines):
        expected_time = time_stack[k]+ machine_times[k]
        if lowest_end_time == None :
            lowest_end_time = expected_time
            next_machine = k 
        elif expected_time < lowest_end_time:
            lowest_end_time = expected_time
            next_machine = k 
    #assign it to lowest end time 
    time_stack[next_machine] += machine_times[next_machine]


latest_completion_time = max(time_stack)
print(latest_completion_time)

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: TIME LIMIT EXCEEDED

Test 5

Verdict: TIME LIMIT EXCEEDED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: TIME LIMIT EXCEEDED

Test 12

Verdict: TIME LIMIT EXCEEDED

Test 13

Verdict: TIME LIMIT EXCEEDED

Test 14

Verdict: ACCEPTED