Faster Top K midly harmful.

Our TopK collector uses a buffer / median approach.
It is faster for general Top K.

However when search allows pruning (sort by score), the fact that we do not have the most accurate threshold is actually harming performance a bit.

For TopK collector by score, we should rely on a BinaryHeap.