标签：
Description
A set of n<tex2html_verbatim_mark> 1-dimensional items have to be packed in identical bins. All bins have exactly the same length l<tex2html_verbatim_mark> and each item i<tex2html_verbatim_mark> has length lil<tex2html_verbatim_mark> . We look for a minimal number of bins q<tex2html_verbatim_mark> such that
You are requested, given the integer values n<tex2html_verbatim_mark> , l<tex2html_verbatim_mark> , l1<tex2html_verbatim_mark> , ..., ln<tex2html_verbatim_mark> , to compute the optimal number of bins q<tex2html_verbatim_mark> .
The input begins with a single positive integer on a line by itself indicating the number of the cases following, each of them as described below. This line is followed by a blank line, and there is also a blank line between two consecutive inputs.
The first line of the input file contains the number of items n<tex2html_verbatim_mark>(1n
105)<tex2html_verbatim_mark> . The second line contains one integer that corresponds to the bin length l
10000<tex2html_verbatim_mark> . We then have n<tex2html_verbatim_mark> lines containing one integer value that represents the length of the items.
For each test case, the output must follow the description below. The outputs of two consecutive cases will be separated by a blank line.
For each input file, your program has to write the minimal number of bins required to pack all items.
1 10 80 70 15 30 35 10 80 20 35 10 30
6
Note: 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.
#include<cstdio> #include<algorithm> #include<iostream> using namespace std; int x[100002]; int main(){ int t;cin>>t; int g=1; while(t--){ if(g++!=1)puts(""); int n;cin>>n;int m;cin>>m; int sum=0; for(int i=0;i<n;i++){ scanf("%d",x+i); } sort(x,x+n); int i=0,j=n-1; while(i<j){ if(x[i]+x[j]<=m){ j--;i++;sum++; }else{j--;sum++;} } if(i==j)sum++; cout<<sum<<endl; } return 0; }
标签：
原文地址：http://www.cnblogs.com/demodemo/p/4716079.html
