分发饼干

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