T - Olympiad—贪心或者STL

A boy named Vasya has taken part in an Olympiad. His teacher knows that in total Vasya got at least x points for both tours of the Olympiad. The teacher has the results of the first and the second tour of the Olympiad but the problem is, the results have only points, no names. The teacher has to know Vasya's chances.

Help Vasya's teacher, find two numbers — the best and the worst place Vasya could have won. Note that the total results' table sorts the participants by the sum of points for both tours (the first place has the participant who has got the most points). If two or more participants have got the same number of points, it's up to the jury to assign places to them according to their choice. It is guaranteed that each participant of the Olympiad participated in both tours of the Olympiad.

Input

The first line contains two space-separated integers n, x (1 ≤ n ≤ 10⁵; 0 ≤ x ≤ 2·10⁵) — the number of Olympiad participants and the minimum number of points Vasya earned.

The second line contains n space-separated integers: a₁, a₂, ..., a_n (0 ≤ a_i ≤ 10⁵) — the participants' points in the first tour.

The third line contains n space-separated integers: b₁, b₂, ..., b_n (0 ≤ b_i ≤ 10⁵) — the participants' points in the second tour.

The participants' points are given in the arbitrary order. It is guaranteed that Vasya was present in the Olympiad — there are two integersi, j(1 ≤ i, j ≤ n) such, that a_i + b_j ≥ x.

Output

Print two space-separated integers — the best and the worst place Vasya could have got on the Olympiad.

Sample Input

Input

5 2
1 1 1 1 1
1 1 1 1 1

Output

1 5

Input

6 7
4 3 5 6 4 4
8 6 0 4 3 4

Output

1 5

Hint

In the first text sample all 5 participants earn 2 points each in any case. Depending on the jury's decision, Vasya can get the first (the best) as well as the last (the worst) fifth place.

In the second test sample in the best case scenario Vasya wins again: he can win 12 points and become the absolute winner if the total results' table looks like that — {4:8, 6:4, 3:6, 4:4, 4:3, 5:0}.

In this table all participants are sorted by decreasing points and we can see how much a participant earned in the first and in the second tour.

In the worst case scenario Vasya can get the fifth place if the table looks like that — {4:8, 4:6, 6:4, 5:4, 4:3, 3:0}, and he earned 4 and 3 points in the first and second tours, correspondingly.

这道题的题意就是给你两组数字a【】，b【】，还有一个x，a，b分别表示成绩，x为小明可能的最小成绩，求小明的最好的排名和最坏的排名

思路：：最好排名不用说，当然是第一。现在就要求最差排名，其实就是求是求a+b》=x的数最多有好多个，所以我们现在有两种方法，一种是用贪心来做，另一种就是用STL函数来做

STL：

#include<stdio.h>
#include<set>
#include<string.h>
#include<iostream>
using namespace std;
#define mx 100009
int a[mx],b[mx];
multiset<int>::iterator it;
multiset<int> k;


int main()
{
    int i;
    int x,n;
    while(scanf("%d %d",&n,&x)!=EOF)
    {
        for(i=0;i<n;i++)
            scanf("%d",&a[i]);
        k.clear();
        for(i=0;i<n;i++)
        {
            scanf("%d",&b[i]);
            k.insert(b[i]);
        }
        int cnt=0;
        for(i=0;i<n;i++)
        {
             it=k.lower_bound(x-a[i]);
             if(it!=k.end())
             {
                 cnt++;
                 k.erase(it);
             }
        }


      printf("1 %d\n",cnt);


    }
}

一般贪心：

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<set>
#include<algorithm>
using namespace std;
#define mx 100009
#define inff -0x3fffffff
bool cmp(int u,int y)
{
    return u>y;
}
int main()
{
    int i,j;
    int n,m,x;
    int a[mx],b[mx];
    int cnt;
    while(scanf("%d %d",&n,&x)!=EOF)
    {
        for(i=0;i<n;i++)
            scanf("%d",&a[i]);
            sort(a,a+n,cmp);
         for(i=0;i<n;i++)
            scanf("%d",&b[i]);
            sort(b,b+n);
         cnt=0;
         int k=0;
         for(i=0;i<n;i++)
         {
            for(j=k;j<n;j++)
            {
                if(a[i]!=inff&&b[j]!=inff)
                {
                    if(a[i]+b[j]>=x)
                   {

                      a[i]=inff;
                      b[j]=inff;
                      cnt++;
                      k=j;
                      break;
                   }
                }

            }
         }
          printf("1 %d\n",cnt);
    }
}