A food delivery kitchen is at the point (0, 0) on a city map. The array points holds the spots of your customers. Each points[i] = [xi, yi] is one customer.
Return the k customers who are closest to the kitchen. The distance is the straight-line distance (you can compare x*x + y*y and skip the square root).
Return the answer in any order. The tests are made so that the answer is unique, except for its order.
Examples
Example 1:
Input: points = [[2,1],[-3,4],[1,1],[5,5]], k = 2
Output: [[1,1],[2,1]]
Explanation: The squared distances are 5, 25, 2 and 50. The two smallest are 2 and 5, so the answer is [1,1] and [2,1].
Example 2:
Input: points = [[0,2],[-1,-1],[3,0],[4,4]], k = 1
Output: [[-1,-1]]
Explanation: The squared distances are 4, 2, 9 and 32. The smallest is 2, which belongs to [-1,-1].