原题链接：https://vjudge.net/problem/UVA-1149
分类：贪心法
备注：水题
#include<bits/stdc++.h>using namespace std;const int maxn=1e5+5;int t,n,l,x,a[maxn];int main(void){//freopen("in.txt","r",stdin);scanf("%d",&t);while(t--){if(x++)printf("\n");scanf("%d %d",&n,&l);for(int i=1;i<=n;i++)scanf("%d",&a[i]);sort(a+1,a+1+n);int pos=1,ans=0;for(int i=n;i>=pos;i--){int tmp=l-a[i];if(tmp-a[pos]>=0)pos++;ans++;}printf("%d\n",ans);}return 0;}