A top-k monoid that is much faster than SortedListTake
equivalent to: (left ++ right).sorted.take(k)
but doesn't do a total sort
You should STRONGLY prefer this to SortedTakeListMonoid which is deprecated and slow
If you can handle the mutability, mutable.PriorityQueueMonoid is even faster.
NOTE!!!! This assumes the inputs are already sorted! resorting each time kills speed
A top-k monoid that is much faster than SortedListTake equivalent to: (left ++ right).sorted.take(k) but doesn't do a total sort You should STRONGLY prefer this to SortedTakeListMonoid which is deprecated and slow If you can handle the mutability, mutable.PriorityQueueMonoid is even faster.
NOTE!!!! This assumes the inputs are already sorted! resorting each time kills speed