答案:<pre class="brush:cpp;toolbar:false">//参考代码1 C++
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
int n, p;
int a[N];
ll s;
int main() {
cin >> n >> p;
for (int i = 1; i <= n; i ++)
cin >> a[i];
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; i ++) {
int l = i + 1, r = n;
int minn = abs(a[i]-p), maxx = a[i] + p;
int n1, n2; // 记录下标
if (l>r) break;
while (l <= r) { // 找到大于最小值的数
int mid = (l + r) / 2;
if (a[mid] <= minn)
l = mid + 1;
else
r = mid - 1;
}
n1 = l;
l = i + 1, r = n;
while (l <= r) { // 找到小于最大值的数
int mid = (l + r) / 2;
if (a[mid] < maxx)
l = mid + 1;
else
r = mid - 1;
}
n2 = r;
s += (n2 - n1) + 1;
}
cout << s;
return 0;
}</pre><pre class="brush:cpp;toolbar:false">//参考代码2 C语言
#include <stdio.h>
#include <stdlib.h>
long long n, x, cnt;
int a[100005];
int cmpfunc(const void *a, const void *b) {
return (*(int *)a - *(int *)b);
}
int upper_bound(int arr[], int n, int x) {
int l = 0;
int r = n;
while (l < r) {
int mid = l + (r - l) / 2;
if (arr[mid] <= x) {
l = mid + 1;
} else {
r = mid;
}
}
return l;
}
int lower_bound(int arr[], int n, int x) {
int l = 0;
int r = n;
while (l < r) {
int mid = l + (r - l) / 2;
if (arr[mid] < x) {
l = mid + 1;
} else {
r = mid;
}
}
return l;
}
int main() {
scanf("%lld %lld", &n, &x);
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
qsort(a, n, sizeof(int), cmpfunc);
for (int i = 0; i < n - 1; ++i) {
int l, r;
if (a[i] < x) {
l = upper_bound(a + i + 1, n - i - 1, x - a[i]);
} else {
l = upper_bound(a + i + 1, n - i - 1, a[i] - x);
}
r = lower_bound(a + i + 1, n - i - 1, a[i] + x) - 1;
if (l == n - i - 1) {
continue;
}
cnt += (r - l + 1);
}
printf("%lld\n", cnt);
return 0;
}</pre>
这道题暂未补解析。