谢谢您，好心人！
~~刚刚就见祖宗了。。~~
by bjqxszx_wangyiheng @ 2023-11-15 21:18:20
问一下，那#3 WA怎么办？代码如下：
（也可以看我发的帖子）
```cpp
#include<bits/stdc++.h>
using namespace std;
int a[666666];
int main()
{
int n,c,w;
long long z=0;
scanf("%d%d",&n,&c);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
sort(a+1,a+n+1);
for(int i=1;i<=n;i++)
{
w=lower_bound(a+1,a+n+1,a[i]-c)-a;
if(a[w]==a[i]-c)
{
z++;
}
else
{
continue;
}
while(a[w]==a[w+1]&&w+1<=n)
{
w++;
z++;
}
}
printf("%lld",z);
return 0;
}
```
by sunyinghang @ 2023-11-17 19:24:27
@[sunyinghang](/user/793555)
```
while(a[w]==a[w+1]&&w+1<=n)
{
w++;
z++;
}
```
应该是每次移动一位太慢了
by yansanqianke @ 2023-11-18 17:52:39
@[yansanqianke](/user/466392) 哦
by sunyinghang @ 2023-11-21 13:18:08