Skip to main content
Back to ChallengesAssign CookiesEasy 15 min

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.

Examples

Input: g = [1,2,3], s = [1,1]
Output: 1
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 can only make the child whose greed factor is 1 content.

Constraints

  • • 1 <= g.length <= 3 * 10^4
  • • 0 <= s.length <= 3 * 10^4
  • • 1 <= g[i], s[j] <= 2^31 - 1

Complexity Analysis

Time
O(n log n + m log m)
where n and m are the lengths of the arrays (dominated by sorting).
Space
O(1) or O(log n)
auxiliary space for sorting.

Test Cases

#1 Not enough big cookies
Input: g = [1,2,3], s = [1,1]
Expected: 1
#2 Plenty of cookies
Input: g = [1,2], s = [1,2,3]
Expected: 2
Output
Click "Run Code" to see output here...