Bin Packing
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 5484 | Accepted: 2479 |
Description
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 .
- 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 , l1 , ..., ln , to compute the optimal number of bins q .
Input
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.
Output
Your program has to write the minimal number of bins required to pack all items.
Sample Input
10 80 70 15 30 35 10 80 20 35 10 30
Sample Output
6
Hint
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.
由题意可知要找到最小的数目,必须先从最长的一根拿起,然后从最小的里面开始找,一旦符合条件就将其放入,表现为数组的上界减1.
代码如下:
![](https://i-blog.csdnimg.cn/blog_migrate/37270947ab63392a6b647fb80080c598.jpeg)
由题意可知要找到最小的数目,必须先从最长的一根拿起,然后从最小的里面开始找,一旦符合条件就将其放入,表现为数组的上界减1.
代码如下:
#include <iostream>
#include <algorithm>
using namespace std;
int N[100001];
bool cmp(int a,int b)
{
return a>b;
}
int main()
{
int n,l;
while(cin>>n>>l)
{
int cnt=0,sum;
for(int i=0;i<n;i++)
cin>>N[i];
sort(N,N+n,cmp);//按降序排序
//cout<<endl;
//for(int i=0;i<n;i++)
// cout<<N[i]<<endl;
for(int i=0;i<n;i++)
{
cnt++;//总共条数。
sum=l;
sum-=N[i];
if(sum>=N[n-1]) n--;//若符合条件就将上界自减;
}
cout<<cnt<<endl;
}
return 0;
}