For this Question: 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 greed[i], which is the minimum size of a cookie that the child will be content with; and each cookie j has a size sz[j]. If sz[j] >= greed[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.There are two number n(number of childrens) and m(number of cookies) are given in first line of input.
in second line, n space seperated integers, greed of children are given in a row..
in third line, m space seperated integers, sizes of cookies are given in a row..
1 <= greed. length <= 3 * 104
0 <= sz. length <= 3 * 104
1 <= greed[i], sz[j] <= 231 - 1Your goal is to maximize the number of your content children and output the maximum number and print what to report in case of exceptions.Sample Input:
3 2
1 2 3
1 1

Sample 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., I have written this Solution Code: [n,m] = [x for x in input().split()]
ch = [int(x) for x in input().split()]
co = [int(x) for x in input().split()]
count = 0
ch = sorted(ch)
for c in ch:
    try:
        avco = min([x for x in co if x>=c])
        co.remove(avco)
        count = count+1
    except:
        continue
print(count), In this Programming Language: Python, Now tell me if this Code is compilable or not?