solulubeta
Sign in
Story Problems / Greedy
06.06 · Problem

Cookies for the Children

Easy Sort both, match smallest sufficient Pro

This problem is part of solulu Pro

Each child i has a greed factor g[i] (the minimum cookie size that will satisfy them). Each cookie j has a size s[j]. A cookie can be given to at most one child and a child gets at most one cookie. What is the maximum…

Lifetime ₹2,000 ₹1,000 · Beta offer
Mark this problem as solved when you are finished.

Item 60 of 94 · updated 2026-10-12