```cpp
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
using namespace std;
int k,total=0;
long int a[200000],n;
int main()
{
cin>>n>>k;
for(int i=1;i<=n;i++)
cin>>a[i];
sort(a+1,a+n+1);
for(int i=1;i<=n;i++)
{
for(int j=1;j<=i;j++)
{
if(a[i]-a[j]==k) total++;
}
}
cout<<total;
return 0;
}
```
先帮您Markdown一下
by SofanHe @ 2018-03-17 21:28:49
$n^2$算法肯定超时……你试一下$n\log_2n$二分
by Altria_Pendragon_ @ 2018-03-17 21:30:13
您的时间复杂度都达到 $O(n^2)$辣!题目给的N范围可是200000!您的算法必炸啊!
by Ebola @ 2018-03-17 21:30:21