题目链接:http://acm.tju.edu.cn/toj/showp2404.html
Time Limit: 1.0 Seconds Memory Limit: 65536K
Total Runs: 1168 Accepted Runs: 459 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
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 specification
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.
Output specification
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 above instance and an optimal solution is shown in the figure below. Items are numbered from 1 to 10 according to the input order.
Source: Southwestern European 2005
水题,直接排序,然后比较最大和最小就行了。
#include <stdio.h>
#include <algorithm>
using namespace std;
int main(){
int n,length,l[100001];
while(~scanf("%d%d",&n,&length)){
int k=0;
int sum=0;
for(int i=0;i<n;i++)
scanf("%d",&l[i]);
sort(l,l+n);
for(int i=n-1;k<=i;i--){
if(l[i]+l[k]<=length)
k++;
sum++;
}
printf("%d\n",sum);
}
}