UVA 1149 Bin Packing

UVA-1149

/*************************************************************************
> File Name: 0722d.cpp
> Author: Narsh
>
> Created Time: 2016年07月22日 星期五 19时09分18秒
************************************************************************/

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int s[101000],n,T,l,num;
bool cmp(int a,int b) {
return a<b;
}
int main() {
scanf("%d",&T);
while (T--) {
scanf("%d%d",&n,&l);
num=0;
for (int i = 1; i <= n; i++)
scanf("%d",&s[i]);
sort(s+1,s+1+n);
int h=1,t=n;
while (h<=t) {
num++;
int leave=l,times=0;;
while (leave >= s[t] && h <= t && times < 2) {
leave-=s[t];
times++;
t--;
}
while (leave >= s[h] && h <= t && times < 2) {
leave-=s[h];
times++;
h++;
}
}
printf("%d\n",num);
if (T) printf("\n");
}
}