计蒜客 lovers

2017 icpc 西安

#include <bits/stdc++.h>
using namespace std;
const int maxn = 200005;
int a[maxn],b[maxn];
int main(){
    int T,n,k;
    scanf("%d",&T);
    while(T--){
        scanf("%d%d",&n,&k);
        for( int i = 1;i <= n;i++ ) scanf("%d",&a[i]);
        for( int i = 1;i <= n;i++ ) scanf("%d",&b[i]);
        sort( a+1,a+1+n );sort(b+1,b+1+n );
        int p = n;
        int ans = 0;
        for( int i = 1;i <= n;i++ ){
            if( a[i] +b[p] < k ) continue;
            ans++;p--;
            if( p <= 0 ) break;
        }
        printf("%d\n",ans);
    }
    return 0;
}