Codeforces Gym 100340A Cookies

Santa Claus is planning to bring gifts to n children. He has m cookies
and is planning to divide them to n piles. However, as usually
problems come unexpected. The child gets unhappy if somebody gets more
cookies than him. Each child is characterized by his greediness , the
greediness of the i
-th child is g i . The unhappines of the i
-th child is equal to g i a i where a i is the number of children that get more cookies than him. Now Santa wants to divide cookies in such a
way that the total unhappiness is minimized. Each child must get at
least one cookie. Santa would like to give away all m cookies he has.
Help him to do so. Input The first line of the input file contains n
and m (1 ≤ n ≤ 30, n ≤ m ≤ 5000). The second line contains n integer
numbers g 1 ; g 2 ; : : : ; g n (1 ≤ g i ≤ 10 7 ). Output Print the
minimal possible unhappiness at the first line of the output file. The