2144. Minimum Cost of Buying Candies With Discount

class Solution {
    public int minimumCost(int[] cost) {
        Arrays.sort(cost);
        int total = 0;
        int count = 0;
        for (int i = cost.length - 1; i >= 0; i--) {
            count++;
            if (count == 3) {
                count = 0; // Every 3rd candy is free
                continue;
            }
            total += cost[i];
        }
        return total;
    }
}

class Solution:
    def minimumCost(self, cost: List[int]) -> int:
        cost.sort()

        total = 0
        count = 0

        for i in range(len(cost) - 1, -1, -1):
            count += 1

            if count == 3:
                count = 0
                continue

            total += cost[i]

        return total

class Solution {
public:
    int minimumCost(vector<int>& cost) {
        sort(cost.begin(), cost.end());

        int total = 0;
        int count = 0;

        for (int i = cost.size() - 1; i >= 0; i--) {
            count++;

            if (count == 3) {
                count = 0;
                continue;
            }

            total += cost[i];
        }

        return total;
    }
};

/**
 * @param {number[]} cost
 * @return {number}
 */
var minimumCost = function(cost) {
    cost.sort((a, b) => a - b);

    let total = 0;
    let count = 0;

    for (let i = cost.length - 1; i >= 0; i--) {
        count++;

        if (count === 3) {
            count = 0;
            continue;
        }

        total += cost[i];
    }

    return total;
};