|Contests||Virtual Contests||Problems||Submit||Runs Status||Rank List||Forum|
You are requested, given the integer values n, l, l1, ..., ln, to compute the optimal number of bins q.
The first line of the input contains the number of items n (1 ≤ n ≤ 105). The second line contains one integer that corresponds to the bin length l ≤ 10000. We then have n lines containing one integer value that represents the length of the items.
Your program has to write the minimal number of bins required to pack all items.
10 80 70 15 30 35 10 80 20 35 10 30
The above instance and an optimal solution is shown in the figure below. Items are numbered from 1 to 10 according to the input order.