Contests | Virtual Contests | Problems | Submit | Runs Status | Rank List | Forum |

Time Limit: 1.0 Seconds Memory Limit: 65536K

Total Runs: 1199 Accepted Runs: 472 Multiple test files

A set of *n* 1-dimensional items have to be packed in identical bins. All bins have exactly the same
length *l* and each item *i* has length *l*_{i} ≤ *l*. We look for a minimal number of bins *q* such that
### Input specification

### Output specification

### Sample Input

### Sample Output

### Hint

- each bin contains at most 2 items,
- each item is packed in one of the
*q*bins, - the sum of the lengths of the items packed in a bin does not exceed
*l*.

You are requested, given the integer values *n*, *l*, *l*_{1}, ..., *l _{n}*, to compute the optimal number of bins

The first line of the input contains the number of items *n* (1 ≤ *n* ≤ 10^{5}). 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

6

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.

Maintance:Fxz. Developer: SuperHacker, G.D.Retop, Fxz