http://poj.org/problem?id=2782
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
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.
题目大意: 给出n个物品以及箱子的长度l, 然后再给出n个物品的长度li, 一个箱子最多可以放两件物品, 一件物品只能放到一个箱子中, 若li+lj<=l则这两件物品可以放到一个箱子中,求所需要的最少箱子数。
思路: 贪心, 一个箱子最多可以放两件物品, 因此把物品按长度从低到高排序, 然后从前后向中间枚举, 贪心的想法自然是想把一个较长的物品和一个较短的物品放在一个箱子中。
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define INF 0x3f3f3f3f
typedef long long ll;
using namespace std;
int n,l;
int a[100005];
int main()
{
scanf("%d %d",&n,&l);
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
sort(a,a+n);
int cnt=0;
for(int i=n-1,j=0;i>=j;i--)
{
if(a[i]+a[j]<=l)
{
++cnt;
++j;
}
else
++cnt;
}
printf("%d\n",cnt);
return 0;
}