Leetcode 455. Assign Cookies

Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie. Each child i has a greed factor gi, which is the minimum size of a cookie that the child will be content with; and each cookie j has a size sj. If sj >= gi, we can assign the cookie j to the child i, and the child i will be content. Your goal is to maximize the number of your content children and output the maximum number.

Note:
You may assume the greed factor is always positive. 
You cannot assign more than one cookie to one child.

Example 1:

Input: [1,2,3], [1,1]

Output: 1

Explanation: You have 3 children and 2 cookies. The greed factors of 3 children are 1, 2, 3. 
And even though you have 2 cookies, since their size is both 1, you could only make the child whose greed factor is 1 content.
You need to output 1.

题目给出两个输入，第一个代表孩子的想要的饼干数量，第二个代表家长拥有的饼干数量，要求出满足最多孩子的分配方法，那就是把最多的数量的饼干的篮子给需求最多的孩子，如果把多饼干的篮子给需求少的孩子，那么大的孩子就不能满足，满足的孩子数量肯定比较少。所以解法就是对两个vector由大到小排序，如果第一个vector的第一个值小于等于第二个vector的第一个值，说明第一个孩子能被满足，第二个vector下标后移一位，表示第一篮饼干已经分配完毕，反之则不可以。依次往下推，直到得出结果。

class Solution {
public:
    static bool comp(int a, int b) {
        return (a > b);
    }
    int findContentChildren(vector<int>& g, vector<int>& s) {
        if (s.size() == 0) return 0;
        int sum = 0;
        sort(g.begin(), g.end(), comp);
        sort(s.begin(), s.end(), comp);
        int j = 0;
        for (int i = 0; i < g.size(); i++) {
            if (g[i] <= s[j]) {
                sum++;
                j++;
            }
            if (j == s.size()) break;
        }
        return sum;
    }
};