leetcode

0 class Solution {

1 public:

2 int maxIceCream(vector<int> &costs, int coins) {

3 sort(costs.begin(), costs.end());

4 int index = 0, count = 0;

5 while (index < costs.size() && coins - costs[index] >= 0)

6 coins -= costs[index++], count++;

7 return count;

8 }

9 };