Problem

Given a list of 2D points points, where each point is represented as [x, y], and an integer k, return the k points closest to the origin (0, 0). Distance is based on Euclidean distance, and the answer may be returned in any order.

Examples

Example 1:

Input: points = [[1,3],[-2,2]], k = 1
Output: [[-2,2]]
Explanation: The point [-2,2] has smaller distance to the origin.

Example 2:

Input: points = [[3,3],[5,-1],[-2,4]], k = 2
Output: [[3,3],[-2,4]]
Explanation: These are the two points with the smallest distances to the origin.

Constraints

• 1 <= len(points) <= 10^4
• 1 <= k <= len(points)
• -10^4 <= x, y <= 10^4
• Each point is a pair of integers [x, y]