CF990B.Micro-World

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

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 nn bacteria in the Petri dish and size of the ii -th bacteria is aia_i . Also you know intergalactic positive integer constant KK .

The ii -th bacteria can swallow the jj -th bacteria if and only if ai>aja_i > a_j and aiaj+Ka_i \le a_j + K . The jj -th bacteria disappear, but the ii -th bacteria doesn't change its size. The bacteria can perform multiple swallows. On each swallow operation any bacteria ii can swallow any bacteria jj if ai>aja_i > a_j and aiaj+Ka_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]a=[101, 53, 42, 102, 101, 55, 54] and K=1K=1 . The one of possible sequences of swallows is: [101,53,42,102,101,55,54][101, 53, 42, 102, \underline{101}, 55, 54] \to [101,53,42,102,55,54][101, \underline{53}, 42, 102, 55, 54] \to [101,42,102,55,54][\underline{101}, 42, 102, 55, 54] \to [42,102,55,54][42, 102, 55, \underline{54}] \to [42,102,55][42, 102, 55] . In total there are 33 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.

输入格式

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

The second line contains nn space separated integers a1,a2,,ana_1, a_2, \dots, a_n ( 1ai1061 \le a_i \le 10^6 ) — sizes of bacteria you have.

输出格式

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

输入输出样例

  • 输入#1

    7 1
    101 53 42 102 101 55 54
    

    输出#1

    3
    
  • 输入#2

    6 5
    20 15 10 15 20 25
    

    输出#2

    1
    
  • 输入#3

    7 1000000
    1 1 1 1 1 1 1
    

    输出#3

    7
    

说明/提示

The first example is clarified in the problem statement.

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

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

首页