import "sort"
func findContentChildren(g []int, s []int) int {
if len(g) == 0 || len(s) == 0 {
return 0
}
sort.Ints(g)
sort.Ints(s)
i := 0
sum := 0
for j := 0; j < len(s); j++ {
if s[j] >= g[i] {
i++
sum++
if i >= len(g) {
break
}
}
}
return sum
}