Детский праздник и шарики

m, n = map(int, input().split())
t, z, y = map(int, input().split())
time = [[] for i in range(t)]
count = 0
 
for j in range(m):
    count =+ min(t[j])
    if count // z[j] == 0:
        count =+ y[j]
 
print(count)

from random import randint, seed
from time import time
 
seed(42)
start = time()
 
m,n = 15000,1000
#t,z,y = map(list,zip(*[map(int, input().split()) for _ in range(n)]))
t,z,y = map(list,zip(*[[randint(1,100) for i in range(3)] for j in range(n)]))
 
counter = [0]*n
times = t[:]
for _ in range(m):
    i,next_time = min(enumerate(times), key = lambda x: x[1])
    counter[i] += 1
    times[i] += t[i] + y[i]*(counter[i]%z[i]==0)
    
print(f'Время расчета {time()-start:.3f}c')
print(next_time)
print(*counter[:10])

from random import randint, seed
from time import time
import heapq
 
seed(42)
start = time()
 
m,n = 15000,1000
#t,z,y = map(list,zip(*[map(int, input().split()) for _ in range(n)]))
t,z,y = map(list,zip(*[[randint(1,100) for i in range(3)] for j in range(n)]))
 
counter = [0]*n
times = list(zip(t,range(n)))
heapq.heapify(times)
for _ in range(m):
    next_time, i = heapq.heappop(times)
    counter[i] += 1
    heapq.heappush(times, (next_time + t[i] + y[i]*(counter[i]%z[i]==0), i))
    
print(f'Время расчета {time()-start:.3f}c')
print(next_time)
print(*counter[:10])

from random import randint, seed
from time import time
from bisect import insort_left
 
seed(42)
start = time()
 
m,n = 15000,1000
#t,z,y = map(list,zip(*[map(int, input().split()) for _ in range(n)]))
t,z,y = map(list,zip(*[[randint(1,100) for i in range(3)] for j in range(n)]))
 
t = list(map(lambda x: -x, t))
counter = [0]*n
times = sorted(list(zip(t,range(n))))
for _ in range(m):
    next_time, i = times.pop()
    counter[i] += 1
    insort_left(times, (next_time + t[i] - y[i]*(counter[i]%z[i]==0),i))
    
print(f'Время расчета {time()-start:.3f}c')
print(-next_time)
print(*counter[:10])