|Online Judge||Problem Set||Authors||Online Contests||User|
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 li<=l . We look for a minimal number of bins q such that
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 sample instance and an optimal solution is shown in the figure below. Items are numbered from 1 to 10 according to the input order.
[Submit] [Go Back] [Status] [Discuss]
Home Page Go Back To top
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator