代码随想录：分发饼干

class Solution {
public:
    int findContentChildren(vector<int>& g, vector<int>& s) {
        int sum = 0;
        int cook = 0;
        sort(g.begin(), g.end());
        sort(s.begin(), s.end());
        for (int i = 0; i < g.size(); i++) {
            if (cook == s.size())
                break;
            while (cook < s.size()&&s[cook] < g[i]) {
                cook++;
            }
            if(cook<s.size()){
            cook++;
            sum++;
            }

        }
        return sum;
    }
};