QOJ.ac

QOJ

Time Limit: 1 s Memory Limit: 256 MB Total points: 100

#15779. K 远点对

统计

已知平面内 $N$ 个点的坐标,求欧氏距离下的第 $K$ 远点对。

两个点 $P(x_1, y_1)$ 和 $Q(x_2, y_2)$ 的欧氏距离定义为 $d(P, Q) = \sqrt {(x_1 - x_2)^2 + (y_1 - y_2)^2}$。

输入格式

输入文件第一行为用空格隔开的两个整数 $N, K$。

接下来 $N$ 行,每行两个整数 $X, Y$,表示一个点的坐标。

输出格式

输出文件第一行为一个整数,表示第 $K$ 远点对的距离的平方(一定是个整数)。

样例数据

样例 1 输入

10 5
0 0
0 1
1 0
1 1
2 0
2 1
1 2
0 2
3 0
3 1

样例 1 输出

9

子任务

Case # $N$
1 $2000$
2 $5000$
3 $10000$
4 $15000$
5 $20000$
6 $60000$
7 $70000$
8 $80000$
9 $90000$
10 $100000$

对于所有测试点,$1 \leq K \leq 100, K \leq \frac {N(N-1)} {2}, 0 \leq X, Y \lt 2^{31}$。

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.