455. 分发饼干

class Solution 
{
public:
    int findContentChildren(vector<int>& g, vector<int>& s) 
    {
        sort(g.rbegin(),g.rend());
        sort(s.rbegin(),s.rend());
        int res = 0;
        for(int i = 0,j = 0;i < s.size() && j < g.size();)
        {
            if(s[i] < g[j]) j ++;
            else res ++,i ++,j ++;
        }
        return res;
    }
};