Keep the best k items on hand without sorting everything.
Return the k points nearest to (0,0) — by sorting or with a size-k max-heap.