# K Closest Points to Origin
Given a list of `[x, y]` points and an integer `k`, return the `k` points closest to the origin `(0, 0)`, sorted by distance ascending.
A direct application of Module 1's heap lesson: a fixed-size max-heap of the k best-so-far candidates avoids sorting the entire input, which matters when the point list is far larger than k.
**Example:** `points=[[1,3],[-2,2]], k=1` -> `[[-2,2]]`.
Target complexity: O(N log k) time.