鸿山洞的灯

最新推荐文章于 2024-11-17 12:29:56 发布

Merry2004

最新推荐文章于 2024-11-17 12:29:56 发布

阅读量540

点赞数 2

分类专栏：编程

本文链接：https://blog.csdn.net/Merry2004/article/details/79393937

版权

编程专栏收录该内容

120 篇文章

订阅专栏

#include <bits/stdc++.h>
using namespace std;
int p[100001],n,dist,i,ans;
int main(void)
{
scanf ("%d%d",&n,&dist);
for (;i<n;i++)
scanf ("%d",&p[i]);
sort(p,p+n);
for (i=1;i<n-1;i++)
if (p[i-1]!=0&&p[i+1]-p[i-1]<=dist)p[i]=0,ans++;
else
{
int j=i-1;
while (p[j]==0)j--;
if (p[i+1]-p[j]<=dist)p[i]=0,ans++;
}
printf ("%d",ans);
}