程式語言 - LeetCode - C++ - 2144. Minimum Cost of Buying Candies With Discount



題目:


解答:

class Solution {
public:
    int minimumCost(vector<int>& cost) {
        int ans = 0;
        int n = cost.size();

        sort(cost.begin(), cost.end(), greater<int>());

        for (int i = 0; i < n; ++i) {
            if (i % 3 != 2) {
                ans += cost[i];
            }
        }

        return ans;
    }
};