A12663 | Match Points
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given a set of points $x_1$ , $x_2$ , ..., $x_n$ on the number line.
Two points $i$ and $j$ can be matched with each other if the following conditions hold:
- neither $i$ nor $j$ is matched with any other point;
- $|x_i - x_j| \ge z$ .
What is the maximum number of pairs of points you can match with each other?
Two points $i$ and $j$ can be matched with each other if the following conditions hold:
- neither $i$ nor $j$ is matched with any other point;
- $|x_i - x_j| \ge z$ .
What is the maximum number of pairs of points you can match with each other?
输入格式
The first line contains two integers $n$ and $z$ ( $2 \le n \le 2 \cdot 10^5$ , $1 \le z \le 10^9$ ) — the number of points and the constraint on the distance between matched points, respectively.
The second line contains $n$ integers $x_1$ , $x_2$ , ..., $x_n$ ( $1 \le x_i \le 10^9$ ).
The second line contains $n$ integers $x_1$ , $x_2$ , ..., $x_n$ ( $1 \le x_i \le 10^9$ ).
输出格式
Print one integer — the maximum number of pairs of points you can match with each other.
输入输出样例
输入 #1
4 2 1 3 3 7
输出 #1
2
输入 #2
5 5 10 9 5 8 7
输出 #2
1
In the first example, you may match point $1$ with point $2$ ( $|3 - 1| \ge 2$ ), and point $3$ with point $4$ ( $|7 - 3| \ge 2$ ).
In the second example, you may match point $1$ with point $3$ ( $|5 - 10| \ge 5$ ).
In the second example, you may match point $1$ with point $3$ ( $|5 - 10| \ge 5$ ).
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted