Micro-World CodeForces - 990B （水题）

B. Micro-World

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You have a Petri dish with bacteria and you are preparing to dive into the harsh micro-world. But, unfortunately, you don't have any microscope nearby, so you can't watch them.

You know that you have $n$ bacteria in the Petri dish and size of the $i$-th bacteria is $a_i$. Also you know intergalactic positive integer constant $K$.

The $i$-th bacteria can swallow the $j$-th bacteria if and only if $a_i>a_j$ and $a_i\le a_j+K$. The $j$-th bacteria disappear, but the $i$-th bacteria doesn't change its size. The bacteria can perform multiple swallows. On each swallow operation any bacteria $i$ can swallow any bacteria $j$if $a_i>a_j$ and $a_i\le a_j+K$. The swallow operations go one after another.

For example, the sequence of bacteria sizes $a=[101,53,42,102,101,55,54]$ and $K=1$. The one of possible sequences of swallows is: $[101,53,42,102,\underset{–}{101},55,54]$ $\to$ $[101,\underset{–}{53},42,102,55,54]$ $\to$ $[\underset{–}{101},42,102,55,54]$ $\to$ $[42,102,55,\underset{–}{54}]$ $\to$ $[42,102,55]$. In total there are $3$ bacteria remained in the Petri dish.

Since you don't have a microscope, you can only guess, what the minimal possible number of bacteria can remain in your Petri dish when you finally will find any microscope.

Input

The first line contains two space separated positive integers $n$ and $K$ ($1\le n\le 2\cdot {10}^5$, $1\le K\le {10}^6$) — number of bacteria and intergalactic constant $K$.

The second line contains $n$ space separated integers $a_1,a_2,\dots ,a_n$ ($1\le a_i\le {10}^6$) — sizes of bacteria you have.

Output

Print the only integer — minimal possible number of bacteria can remain.

Examples

input

Copy

7 1
101 53 42 102 101 55 54

output

Copy

3

input

Copy

6 5
20 15 10 15 20 25

output

Copy

1

input

Copy

7 1000000
1 1 1 1 1 1 1

output

Copy

7

Note

The first example is clarified in the problem statement.

In the second example an optimal possible sequence of swallows is: $[20,15,10,15,\underset{–}{20},25]$ $\to$ $[20,15,10,\underset{–}{15},25]$ $\to$ $[20,15,\underset{–}{10},25]$ $\to$ $[20,\underset{–}{15},25]$ $\to$ $[\underset{–}{20},25]$ $\to$ $\left[25\right]$.

In the third example no bacteria can swallow any other bacteria.

题意：有n个细菌，每个细菌的尺寸为ai，现在有以常数k，如果细菌i的尺寸ai大于细菌j的尺寸aj，并且ai<=aj+k,那么细菌i就可以吃掉细菌j，问最后可以剩于多少个细菌。

思路：去重排序，前后比较一下就可以了（有尺寸相同的情况，所以要去重，用map记录一下该尺寸的细菌的个数即可）

#include "iostream"
#include "algorithm"
#include "map"
using namespace std;
typedef long long ll;
const int Max=2e5+10;
map<int,int> mp;
int a[Max];
int main()
{
    int n,k;
    mp.clear();
    ios::sync_with_stdio(false);
    cin>>n>>k;
    for(int i=0;i<n;i++){
        cin>>a[i];
        mp[a[i]]++;
    }
    sort(a,a+n);
    int len=unique(a,a+n)-a;
    int ans=n;
    for(int i=1;i<len;i++)
        if(a[i]>a[i-1]&&a[i]<=a[i-1]+k)
            ans-=mp[a[i-1]];
    cout<<ans<<endl;
    return 0;
}