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
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
解题思路:
没啥思路,就直接从大到小排序,两个下标同时从最大值还有最小值开始移动,如果大+小超过了bin的限度,就让大的单独占一个,否则大和小共用一个bin。
#include<stdio.h>
#include<algorithm>
using namespace std;
int il[100010];
bool cmp(int x,int y)
{
return x>y;
}
int main()
{
int n,bl,i,j,ans;
scanf("%d%d",&n,&bl);
for(int i=1;i<=n;i++)
{
scanf("%d",&il[i]);
}
sort(il+1,il+n+1,cmp);
j=n;
i=1;
ans=0;
while(i<=j)
{
if(il[i]+il[j]>bl)
{
i++;
}
else
{
i++;
j--;
}
ans++;
}
printf("%d\n",ans);
}