Maximum-Ice-Cream-Bars.cpp

#include <algorithm>
#include <vector>

using namespace std;

class Solution
{
  public:
    int maxIceCream(vector<int> &costs, int coins)
    {
        sort(costs.begin(), costs.end());
        for (int i = 0; i < costs.size(); i++)
        {
            coins -= costs[i];
            if (coins < 0)
                return i;
        };
        return costs.size();
    }
};

int main()
{
    return 0;
}