CF990B.Micro-World

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 \gt 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 \gt 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, \underline{101}, 55, 54]$ $\to$ $[101, \underline{53}, 42, 102, 55, 54]$ $\to$ $[\underline{101}, 42, 102, 55, 54]$ $\to$ $[42, 102, 55, \underline{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.

你有一个装有细菌的培养皿，正准备潜入这个严酷的微观世界。但不幸的是，你身边没有显微镜，因此无法直接观察它们。

已知培养皿中有 $n$ 个细菌，其中第 $i$ 个细菌的大小为 $a_i$。同时你还知道一个星际正整数常量 $K$。

当且仅当 $a_i \gt a_j$ 且 $a_i \le a_j + K$ 时，第 $i$ 个细菌可以吞食第 $j$ 个细菌。此时第 $j$ 个细菌消失，而第 $i$ 个细菌的大小保持不变。细菌可以进行多次吞食操作：在每次吞食操作中，任意细菌 $i$ 可以吞食任意细菌 $j$，只要满足 $a_i \gt a_j$ 且 $a_i \le a_j + K$。吞食操作依次进行。

例如，细菌大小序列为 $a=[101, 53, 42, 102, 101, 55, 54]$，且 $K=1$。一种可能的吞食序列如下：
$[101, 53, 42, 102, \underline{101}, 55, 54]$ $\to$ $[101, \underline{53}, 42, 102, 55, 54]$ $\to$ $[\underline{101}, 42, 102, 55, 54]$ $\to$ $[42, 102, 55, \underline{54}]$ $\to$ $[42, 102, 55]$。最终培养皿中剩余 $3$ 个细菌。

由于你没有显微镜，你只能猜测：当你最终找到显微镜时，培养皿中可能剩余的细菌数量的最小值是多少？

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.

第一行包含两个用空格分隔的正整数 $n$ 和 $K$（$1 \le n \le 2 \cdot 10^5$，$1 \le K \le 10^6$）——分别为细菌的数量和星际常数 $K$。

第二行包含 $n$ 个用空格分隔的整数 $a_1, a_2, \dots, a_n$（$1 \le a_i \le 10^6$）——表示你所拥有的细菌的尺寸。

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

输出唯一的整数——可能剩余的细菌数量的最小值。

The first example is clarified in the problem statement.

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

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

第一个示例已在题目描述中阐明。

在第二个示例中，一种最优的吞食序列如下：$[20, 15, 10, 15, \underline{20}, 25]$ $\to$ $[20, 15, 10, \underline{15}, 25]$ $\to$ $[20, 15, \underline{10}, 25]$ $\to$ $[20, \underline{15}, 25]$ $\to$ $[\underline{20}, 25]$ $\to$ $[25]$。

在第三个示例中，没有任何细菌能够吞食其他细菌。