#1833
Maximum Ice Cream Bars
pupil · 535 · lc medium +28 · verified · 74.2% accepted · 2,259 likes · top 85%
Description
A boy wants to buy as many ice cream bars as possible on a summer day. He has coins coins and there are n bars with prices stored in array costs (where costs[i] is the price of bar i). He may purchase bars in any order.
Return the maximum number of bars he can buy without spending more than coins.
Note: You must use a counting sort approach for this problem.
Example 1:
Input: costs = [1,3,2,4,1], coins = 7
Output: 4
Explanation: The boy can buy ice cream bars at indices 0,1,2,4 for a total price of 1 + 3 + 2 + 1 = 7.
Example 2:
Input: costs = [10,6,8,7,7,8], coins = 5
Output: 0
Explanation: The boy cannot afford any of the ice cream bars.
Example 3:
Input: costs = [1,6,3,1,2,5], coins = 20
Output: 6
Explanation: The boy can buy all the ice cream bars for a total price of 1 + 6 + 3 + 1 + 2 + 5 = 18.
Code
1
2
3