classSolution{public:intmaxIceCream(vector<int>& w,int m){int n = w.size();sort(w.begin(), w.end());int res =0;for(int i =0; i < n; i ++){if(m >= w[i]){
m -= w[i];
res ++;}elsebreak;}return res;}};
LeetCode每日一题:雪糕的最大数量思路每一次取价格最小的雪糕,可以买的数量一定是最多的class Solution {public: int maxIceCream(vector<int>& w, int m) { int n = w.size(); sort(w.begin(), w.end()); int res = 0; for (int i = 0; i < n; i ++ )