Problem - Assign Cookies

You have cookies with sizes and children with greed factors. Each child accepts a cookie if its size is at least their greed factor. Assign cookies to maximize the number of content children. Each cookie can be given to at most one child.

This can be solved greedily (sort both, assign smallest valid cookie) or as bipartite matching (children are $L$, cookies are $R$, edges when size $\geq$ greed).