#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=1e5+50;
int a[maxn];
int main(){
int T;
scanf("%d",&T);
while(T--){
int n,l;
scanf("%d%d",&n,&l);
for(int i=0;i<n;i++)scanf("%d",a+i);
sort(a,a+n);
int count =0;
int min=0,max=n-1;
while(min<=max){
if(a[min]+a[max]<=l){
min++;
max--;
count++;
}
else {
count++;
max--;
}
}
printf("%d\n",count);
if(T>0)printf("\n");
}
return 0;
}
UVA 1149 Bin Packing 装箱(简单贪心)
最新推荐文章于 2022-09-21 21:35:35 发布