Abridged problem description:
Given the length of n snakes, a_0, a_1, a_2, ......... a_{n-1}.
A snake i can eat another snake j, if a_j \leq a_i and after eating a snake, it's length is increased by 1.
Given q queries. Each query contains an integer x, you have to tell what is the maximum number of snakes you can get which are of length at least x.
Problem link: SNAKEEAT
Soultion:
Let...
