CodeForces 222D - Olympiad

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
int n,x;
int s1[100005],s2[100005];
int main()
{
scanf("%d%d",&n,&x);
for(int i=0;i<n;i++) scanf("%d",&s1[i]);
for(int i=0;i<n;i++) scanf("%d",&s2[i]);
sort(s1,s1+n);
sort(s2,s2+n);
int i,j=0;
for(i=n-1;i>=0;i--)
{
while(x>s1[i]+s2[j])
{
j++;
if(j>=n) break;
}
if(j>=n) break;
j++;
}
printf("1 %d\n",n-i-1);
}