990B.md (2468B)
1 Source: https://codeforces.com/problemset/problem/990/B 2 3 B. Micro-World 4 5 time limit per test 6 7 2 seconds 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 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. 22 23 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$. 24 25 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. 26 27 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. 28 29 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. 30 31 Input 32 33 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$. 34 35 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. 36 37 Output 38 39 Print the only integer — minimal possible number of bacteria can remain. 40 41 Examples 42 43 Input 44 45 ``` 46 7 1 47 101 53 42 102 101 55 54 48 ``` 49 50 Output 51 52 ``` 53 3 54 ``` 55 56 Input 57 58 ``` 59 6 5 60 20 15 10 15 20 25 61 ``` 62 63 Output 64 65 ``` 66 1 67 ``` 68 69 Input 70 71 ``` 72 7 1000000 73 1 1 1 1 1 1 1 74 ``` 75 76 Output 77 78 ``` 79 7 80 ``` 81 82 Note 83 84 The first example is clarified in the problem statement. 85 86 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]$. 87 88 In the third example no bacteria can swallow any other bacteria.