Codeforces Round #137 (Div. 2) D

Codeforces Round #137 (Div. 2) D.cpp

//By Brickgao
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <vector>
using namespace std;

int n, x;
int a[100010], b[100010];

bool cmp(int a, int b)
{
    return a > b;
}

int main()
{
    int i, ans, tail;
    while(~scanf("%d%d", &n, &x))
    {
        for(i = 0; i < n; i++)
            scanf("%d", &a[i]);
        for(i = 0; i < n; i++)
            scanf("%d", &b[i]);
        sort(a, a + n, cmp);
        sort(b, b + n, cmp);
        ans = 0;
        tail = n - 1;
        for(i = 0; i < n ; i++)
        {
            while(a[i] + b[tail] < x && tail >= 0) tail --;
            if(tail >= 0)
            {
                ans ++;
                tail --;
            }   
        }
        printf("1 %d\n", ans);
    }
    return 0;
}