呵呵。
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;int T,X,N,S[10001];int main(){freopen("A-large-practice.in","r",stdin);freopen("a.large","w",stdout);cin>>T;for(int cas=1; cas<=T; ++cas){cin>>N>>X;for(int i=0; i<N; ++i){cin>>S[i];}sort(S,S+N);int ans=0;for(int i=N-1,j=0; i>=j; --i){if(S[i]+S[j]<=X){++j;}++ans;}printf("Case #%d: %d\n",cas,ans);}
}