3649 - Diamond Collector 3649 - Diamond Collector 3649 - Diamond Collector

Statistics Sub: 176 | AC: 88 | AC%: 50,00 | Score: 1,65
Created by USACO
Added by jlcastrillon (2016-05-26)
Limits
Total Time: 10000 MS | Test Time: 1000 MS |Memory: 5 GB | Output: 64 MB | Size: 16 KB
Enabled languages
Available in

Description

Jose the camel, always a fan of shiny objects, has taken up a hobby of mining diamonds in her spare time! She has collected N diamonds (N1000) 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

(two diamonds can be displayed together in the case if their sizes differ by exactly K). Given K, please help Bessie determine the maximum number of diamonds she can display in the case.
Jose the camel, always a fan of shiny objects, has taken up a hobby of mining diamonds in her spare time! She has collected N diamonds (N1000) 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

(two diamonds can be displayed together in the case if their sizes differ by exactly K). Given K, please help Bessie determine the maximum number of diamonds she can display in the case.
Jose the camel, always a fan of shiny objects, has taken up a hobby of mining diamonds in her spare time! She has collected N diamonds (N1000) 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

(two diamonds can be displayed together in the case if their sizes differ by exactly K). Given K, please help Bessie determine the maximum number of diamonds she can display in the case.

Input specification

The first line of the input file contains N and K (0K10,000). The next 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.
The first line of the input file contains N and K (0K10,000). The next 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.
The first line of the input file contains N and K (0K10,000). The next 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.

Output specification

Output a single positive integer, telling the maximum number of diamonds that Bessie can showcase. ;jsessionid=753835D70D0637CB2F099D39202A4AC5
Output a single positive integer, telling the maximum number of diamonds that Bessie can showcase. ;jsessionid=753835D70D0637CB2F099D39202A4AC5
The first line of the input file contains N and K (0K10,000). The next 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.

Sample input

5 3
1
6
4
3
1

Sample output

4

Hint(s)

http://coj.uci.cu/24h/
http://coj.uci.cu/24h/
http://coj.uci.cu/24h/

Recommendation

We have carefully selected several similar problems: 3675 | 3376 | 2769 | 1873 | 2441 | 1005