AlgoLounge

Assign Cookies

easy

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

Example 1

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. You have 2 cookies of size 1, so you can only make the child whose greed factor is 1 content. You need to output 1.

Example 2

Input:  g = [1,2], s = [1,2,3]
Output: 2

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.

Constraints

  • 1 <= g.length <= 3 * 10^4
  • 0 <= s.length <= 3 * 10^4
  • 1 <= g[i], s[j] <= 2^31 - 1
TypeScript
Loading editor…
List of test cases (12)
Case 1
g = [1,2,3]
s = [1,1]
Case 2
g = [1,2]
s = [1,2,3]
Case 3
g = [10,9,8,7]
s = [5,6,7,8]
Case 4
g = [1]
s = []
Case 5
g = [1]
s = [1]
Case 6
g = [1]
s = [2]
Case 7
g = [2]
s = [1]
Case 8
g = [1,2,3,4,5]
s = [5]
Case 9
g = [5,4,3,2,1]
s = [1,2,3,4,5]
Case 10
g = [1,2,3]
s = [3]
Case 11
g = [7,8,9,10]
s = [5,6,7,8]
Case 12
g = [1,1,1]
s = [1,1,1]