[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 g_i, which is the minimum size of a cookie that the child will be content with; and each cookie j has a size s_j. If s_j >= g_i, 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.

Example 2:

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

Output: 2

Explanation: You have 2 children and 3 cookies. The greed factors of 2 children are 1, 2. 
You have 3 cookies and their sizes are big enough to gratify all of the children, 
You need to output 2.

思路：贪心 O(nlogn)

最近学了贪心，从最简单的题刷起。思路倒是很好想，给两个数组排序，然后按照最小曲奇大小优先满足最少贪婪需求的孩子，或者最大曲奇优先满足需求最高的孩子。

证明贪心策略的正确性。只说明最大优先，最小优先可同理推得。若最大曲奇没有给了除了最大需求外的另一个孩子是一种正确组合，那么把最大曲奇拿来给最大需求则可以保持结果没有变坏。这时，去掉最大曲奇和最大需求的孩子，得到的子问题相同。

代码如下，最大优先：

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