Content Children

Difficulty: 1200 3000 ms 128 MB

greedy sorting

Child i is content with a cookie of size ≥ g_i; each child gets at most one cookie. Maximize the number of content children.

Input: the first line has N and M; the second line has the N greed values; the third line has the M cookie sizes.

Output: the maximum number of content children.

Constraints:

• 1 ≤ N, M ≤ 10⁵
• 1 ≤ g_i, s_j ≤ 100

Sample Tests

3 2
1 2 3
1 1

1

2 3
1 2
1 2 3

2

Read the Editorial