1648. Sell Diminishing-Valued Colored Balls

Updated: 2024-03-12
1 min read
[]

On This Page

LeetCode problem 1648

class Solution:
    def maxProfit(self, inventory: List[int], orders: int) -> int:
        inventory.sort(reverse=True)
        mod = 10**9 + 7
        res = i = 0
        n = len(inventory)
        while orders > 0:
            while i < n and inventory[i] >= inventory[0]:
                i += 1
            nxt = 0
            if i < n:
                nxt = inventory[i]
            cnt = i
            x = inventory[0] - nxt
            tot = cnt * x
            if tot > orders:
                decr = orders // cnt
                a1, an = inventory[0] - decr + 1, inventory[0]
                res += (a1 + an) * decr // 2 * cnt
                res += (inventory[0] - decr) * (orders % cnt)
            else:
                a1, an = nxt + 1, inventory[0]
                res += (a1 + an) * x // 2 * cnt
                inventory[0] = nxt
            orders -= tot
            res %= mod
        return res