Loading problem

K Closest Points to Origin

Given an array of `points` where points[i] = [x, y], and an integer `k`, return the k points closest to the origin (0,0) by Euclidean distance. Break ties by smaller x then y, and return the result sorted, for a deterministic order.

Examples

in: points = [[1,3],[-2,2]], k = 1

out: [[-2,2]]

(-2,2) is closer

Constraints

1 <= k <= len(points) <= 10^4
-10^4 <= x, y <= 10^4

Hints

target: O(n log k) time⌘↩ run · ⇧⌘↩ submit