14November2024 - 2064. Minimized Maximum of Products Distributed to Any Store.py

# https://leetcode.com/problems/minimized-maximum-of-products-distributed-to-any-store/

class Solution:
    def minimizedMaximum(self, n: int, quantities: List[int]) -> int:
    
        def can_distribute(max_products: int) -> bool:
            stores_needed = 0
            for q in quantities:
                
                stores_needed += (q + max_products - 1) // max_products
            return stores_needed <= n
        
        left, right = 1, max(quantities)
        
        while left < right:
            mid = (left + right) // 2
            if can_distribute(mid):
                right = mid
            else:
                left = mid + 1
                
        return left