Untitled
unknown
python
2 years ago
448 B
20
Indexable
def getMinimumOperations( executionTime, x, y):
def check(t):
cnt = 0
for v in executionTime:
if v > t * y:
cnt += math.ceil((v - t * y) / (x - y))
return cnt <= t
l, r = 0, max(executionTime)
while l < r:
mid = (l + r) >> 1
if check(mid):
r = mid
else:
l = mid + 1
return l
Editor is loading...
Leave a Comment