class Solution:
def minimumSize(self, nums: List[int], maxOperations: int) -> int:
def check(nums, mid):
ans = 0
for n in nums:
basic = n//mid
if n%mid :
ans += basic + 1
else:
ans += basic
return ans
r = max(nums)
l = 1
while l < r :
mid = l + r >> 1
if check(nums, mid) > len(nums) + maxOperations:
l = mid + 1
else:
r = mid
return l