Maximum Ice Cream Bars LeetCode solution in C++

1
class Solution {
2
 public:
3
  int maxIceCream(vector<int> &costs, int coins) {
4
    int n = costs.size();
5

6
    sort(costs.begin(), costs.end());
7

8
    int i = 0;
9
    for (; i < n && coins >= costs[i]; i++) {
10
      coins -= costs[i];
11
    }
12

13
    return i;
14
  }
15
};