O(nlog(n))
int cmp(const void * a, const void * b)
{
return * (int * )b - * (int * )a;
}
int findContentChildren(int* g, int gSize, int* s, int sSize){
qsort(g, gSize, sizeof(int), cmp);
qsort(s, sSize, sizeof(int), cmp);
int rst=0;
gSize--;
sSize--;
while(gSize>=0&&sSize>=0){
if(g[gSize]<=s[sSize--]){
rst++;
gSize--;
continue;
}
}
return rst;
}