Is this about points in the euclidean plane, looking for the closest points to a particular point? Yeah, I guess adding them all to a priority queue and popping the first k would do it. If you are looking for the tightest k-cluster then it's not very easy as an interview question.