• Skip to primary navigation
  • Skip to content
  • Skip to footer
zhicheng xie's demo blog
  • Quick-Start Guide

    Your Name

    I am an amazing person.

    • Somewhere

    Minimum Cost of Buying Candies With Discount

    less than 1 minute read

    <-E 2144> Minimum Cost of Buying Candies With Discount

    class Solution {
    public:
        int minimumCost(vector<int>& cost) {
            sort(cost.begin(), cost.end(), greater<int>());
            int ans = 0;
            int k = 0;
            for(auto i : cost) {
                k++;
                if(k == 3)
                    k = 0;
                else
                    ans += i;
            }
            return ans;
        }
    };
    

    Tags: Algorithms, C++, Leetcode

    Updated: April 16, 2022

    Share on

    Twitter Facebook LinkedIn
    Previous Next

    You may also enjoy

    Decode Ways

    less than 1 minute read

    <-M 91> Decode Ways

    Word Break

    less than 1 minute read

    <-H 139> Word Break

    Distinct Subsequences

    less than 1 minute read

    <-H 115> Distinct Subsequences

    Edit Distance

    less than 1 minute read

    <-H 72> Edit Distance

    • Follow:
    • Feed
    © 2023 zhicheng xie's blog. Powered by Jekyll & Minimal Mistakes.