[DAY17]Greedy Florist

Greedy Florist | HackerRank

Solution: Greedy method. We would assign the flower to the people from the highest to the lowest price. Next trick is we would assign the flower to the person with the least number of flowers assigned before. Finally, we would need to sort the given c array first. :D