洛谷P1102 A-B 数对进阶解法

最新推荐文章于 2024-07-09 16:08:07 发布

「已注销」

最新推荐文章于 2024-07-09 16:08:07 发布

阅读量116

点赞数 1

分类专栏：程序设计代码共享

本文链接：https://blog.csdn.net/weixin_52075219/article/details/115638438

版权

程序设计代码共享专栏收录该内容

183 篇文章 24 订阅

订阅专栏

#include<cstdio>
#include<algorithm>

const int MAX = 200001;
int N, C;
int arr[MAX];

inline int quickread() {
	int x = 0, sign = 0;
	char c = getchar();
	while (c < '0' || c > '9') {
		if ('-' == c) {
			sign = 1;
		}
		c = getchar();
	}
	while ('0' <= c && c <= '9') {
		x = (x << 3) + (x << 1) + (c ^ 0x30);
		c = getchar();
	}
	return sign ? (~x + 1) : x;
}

int main()
{
	long long num = 0;
	N = quickread();
	C = quickread();
	for (int i = 0; i < N; i++)
		arr[i] = quickread();
	std::sort(arr, arr + N);
	for (int i = 0; i < N; i++)
		num += std::upper_bound(arr, arr + N, arr[i] + C) - std::lower_bound(arr, arr + N, arr[i] + C);
	printf("%lld", num);
	return 0;
}