Diamond Collector

Points: 100 (partial)

Time limit: 1.0s

Memory limit: 64M

Author:

Problem type

Allowed languages

Ada, Assembly, Awk, BrainF***, C, C#, C++, Dart, Go, Java, JS, Kotlin, Lua, Pascal, Perl, Prolog, Python, Scala, Swift, VB

Bessie the cow, always a fan of shiny objects, has taken up a hobby of mining diamonds in her spare time! She has collected $N$ ~N~ diamonds ( $N \le 1000$ ~ N \le 1000~) of varying sizes, and she wants to arrange some of them in a display case in the barn.

Since Bessie wants the diamonds in the case to be relatively similar in size, she decides that she will not include two diamonds in the case if their sizes differ by more than $K$ ~K~ (two diamonds can be displayed together in the case if their sizes differ by exactly $K$ ~K~). Given $K$ ~K~, please help Bessie determine the maximum number of diamonds she can display in the case.

Input

The first line of the input file contains $N$ ~N~ and $K$ ~K~ $(0 \leq K \leq 10\,000)$ ~(0 \leq K \leq 10\,000)~. The next $N$ ~N~ lines each contain an integer giving the size of one of the diamonds. All sizes will be positive and will not exceed $10\,000$ ~10\,000~.

Output

Output a single positive integer, telling the maximum number of diamonds that Bessie can showcase.

Sample input

Sample output

Comments

1

Jose_Ernesto commented on Dec. 14, 2023, 6:57 p.m.

,

1

LeandroGamer commented on May 28, 2023, 12:33 p.m.

Esta en ingles

1

linkyless commented on May 23, 2022, 5:51 p.m.

Buen ejercicio. ♥

1

maxwell commented on Jan. 24, 2018, 8:49 p.m.

El problema 1 me esta dando un error de compilacion que no me da en mi maquina. Quizas es que mi configuracion a la hora de la compilacion es muy permisiva. O quizas la suya muy restrictiva. Por favor... revisar eso para saber.