We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Greedy
  4. Greedy Florist
  5. Discussions

Greedy Florist

  • nsav2820
     + 0 comments

    Python 3 - sort desc, caclulate multiplier by flooring the division of flower index and number of friends (this is the "round" of purchase), multiply times price, loop exists at last flower.

    def getMinimumCost(k, c):
    c = sorted(c, reverse=True) 

    total_cost = 0

    for i in range(len(c)):
        multiplier = (i // k) + 1  
        total_cost += multiplier * c[i]

    return total_cost