Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie.

Each child i has a greed factor g[i], which is the minimum size of a cookie that the child will be content with; and each cookie j has a size s[j]. If s[j] &gt;= g[i], we can assign the cookie j to the child i, and the child i will be content. Your goal is to maximize the number of your content children and output the maximum number.

&nbsp;
Example 1:

Input: g = [1,2,3], s = [1,1]
Output: 1
Explanation: You have 3 children and 2 cookies. The greed factors of 3 children are 1, 2, 3. 
And even though you have 2 cookies, since their size is both 1, you could only make the child whose greed factor is 1 content.
You need to output 1.


Example 2:

Input: g = [1,2], s = [1,2,3]
Output: 2
Explanation: You have 2 children and 3 cookies. The greed factors of 2 children are 1, 2. 
You have 3 cookies and their sizes are big enough to gratify all of the children, 
You need to output 2.


&nbsp;
Constraints:


	1 &lt;= g.length &lt;= 3 * 104
	0 &lt;= s.length &lt;= 3 * 104
	1 &lt;= g[i], s[j] &lt;= 231 - 1


class Solution:
    def findContentChildren(self, g: List[int], s: List[int]) -> int:
        g.sort()
        s.sort()
        cont = 0
        c = 0
        k = 0
        while k< len(s) and c < len(g):
            if s[k] >= g[c]:
                c+=1
                k+=1
                cont+=1
            else:
                k+=1
        return cont
class Solution {
    public int findContentChildren(int[] g, int[] s) {
        int i =0,j=0,c=0;
        
        Arrays.sort(g);
        Arrays.sort(s);
        
        
        for(;i< g.length;i++)
        {
                // System.out.println(s[j]+" "+g[i]);
 
            while(j<s.length)
            {
                if(s[j]>=g[i] )
                {
                    // System.out.println(s[j]+" "+g[i]);
                    j++;c++;
                    break;
                }
                j++;
            }
        }
       
        return c;
        
    }
}
class Solution {
public:
    int findContentChildren(vector<int>& g, vector<int>& s) {
        int n=g.size();
        int m=s.size();
        if(n==0 or m==0)return 0;
        sort(g.begin(),g.end());
        sort(s.begin(),s.end());
        int i=0,j=0;
        while(i<m and j<n)
        {
            if(s[i]>=g[j])
                j++;
            i++;
        }
        return j;
    }
};
var findContentChildren = function(g, s) {
	g.sort(function(a, b) {
		return b - a;
	});
	s.sort(function(a, b) {
		return a - b;
	});
	
    let content = 0;
    for (let curG of g) {
        for (let curS of s) {
            if (curS >= curG) {
                s.pop();
				content++;	
			    break;
            }
        }
    }

	return content;
}
Assign Cookies