2144. Minimum Cost of Buying Candies With Discount Обновлено: 2024-03-12 1 мин Algorithms , LeetCode СодержаниеLeetCode problem 2144class Solution: def minimumCost(self, cost: List[int]) -> int: cost.sort(reverse=True) return sum(cost) - sum(cost[2::3])