Minimum Cost of Buying Candies With Discount

1
2
3
4
5
6
7
8

class Solution:
    def minimumCost(self, cost: List[int]) -> int:
        cost.sort(reverse=True)
        total_cost = 0
        for i in range(len(cost)):
            if i % 3 != 2:
                total_cost += cost[i]
        return total_cost