8151: Diamond Collector

奶牛贝茜非常喜欢闪闪发光的东西，她会在业余时间开采钻石。

她收藏了 N 颗大小不等的钻石，她想将其中的一些摆放在牛棚的一对展示柜当中。

为了使同一展示柜中的钻石尺寸大小相似，她不会将两颗尺寸大小相差超过 K 的钻石放在同一个柜子中（刚好相差 K，则没有问题）。

给定 K，请帮助贝茜计算在两个展示柜中一共可以摆放的钻石最大数量。

输入格式

第一行包含两个整数 N,K。

接下来 N 行，每行包含一个整数，表示一颗钻石的尺寸。

输出格式

输出贝茜可以在两个展示柜中展示的钻石最大数量。

数据范围

1≤N≤50000,

0≤K≤109,

钻石的尺寸范围 [1,109]


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 diamonds (N≤50,000) of varying sizes, and she wants to arrange some of them in a pair of display cases in the barn.

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