[leetcode]455. Assign Cookies

[leetcode]455. Assign Cookies

---

Analysis

待会要考政治—— [生死有命富贵在天！！！]

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.
分蛋糕，使得尽可能多的孩子满足。两个数组都排一下序，然后遍历，使得每次选出来的蛋糕尺寸都是最小的。

Implement

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