題目詢問說共可以滿足幾個小孩所期望的蛋糕數，例如總共有三個小孩A, B, C，A希望獲得1片蛋糕；B希望獲得2片蛋糕；C希望獲得3片蛋糕，而總共有兩塊蛋糕Z, X，Z可以切成1片，X可以切成兩片，這樣的話答案是2，因為最多只能滿足兩個小孩的需求。依照這個思路去撰寫Code就容易得多了。
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.
You may assume the greed factor is always positive.
You cannot assign more than one cookie to one child.