[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.

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.

这道题是分饼干给小孩，尽可能让更多的小孩满意，题目难度为Easy。

​s和g都是无序的，这里先分别对两者进行排序以便后续处理。对于任意小孩的需求g[i]，它能够由s[i] >=
g[i]的所有饼干满足，这里优先选择其中s[i]最小的来满足g[i]，以防先选了大的之后后续小孩无法由其来满足。通过此贪婪策略即可求出最多能够让几个小孩满意。具体代码：class Solution {
public:
int findContentChildren(vector<int>& g, vector<int>& s) {
int idx = 0;
sort(g.begin(), g.end());
sort(s.begin(), s.end());
for(auto sz:s) {
if(sz >= g[idx]) {
++idx;
if(idx == g.size()) break;
}
}
return idx;
}
};