You are given an integer k and n particular focuses with integer facilitates on the Euclidean plane, the I-th point has arranges (xi,yi). Consider a rundown of all the n(n−1)2 sets of focuses ((xi,yi),(xj,yj)) (1≤i
Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science.
You are given an integer k and n particular focuses with integer facilitates on the Euclidean plane, the I-th point has arranges (xi,yi).
Consider a rundown of all the n(n−1)2 sets of focuses ((xi,yi),(xj,yj)) (1≤i<j≤n). For each such pair, work out the separation from the line through these two focuses to the beginning (0,0).
You will likely work out the k-th most modest number among these distances.
Input
The principal line contains two integers n, k (2≤n≤105, 1≤k≤n(n−1)2).
The I-th of the following n lines contains two integers xi and yi (−104≤xi,yi≤104) — the directions of the I-th point. It is ensured that all given focuses are pairwise particular.
Output
You should output one number — the k-th littlest separation from the beginning. Your answer is considered right if its outright or relative blunder doesn't surpass 10−6.
Officially, let your answer be a, and the jury's answer be b. Your answer is acknowledged whether and provided that |a−b|max(1,|b|)≤10−6.
Step by step
Solved in 4 steps with 1 images
