python
class Solution(object):
def findContentChildren(self, g, s):
num=0
g.sort()
s.sort()
index=0
for i in range(len(s)):
while index<len(g) and s[i]>=g[index]:
index+=1
num+=1
break
return num