Problem - Assign Cookies

Each child has a greed factor. Each cookie has a size. A child is satisfied if they get a cookie with size at least their greed. Maximize satisfied children. For $greed = [1,2,3]$ and $cookies = [1,1]$, answer is $1$. Only one child can be satisfied.

Here's a classic matching problem.

Think about which child to satisfy first with which cookie.