"Batch" partial sorting algorithm
What I was looking for is a selection algorithm that will select the k-th element.
As mentioned in comment, running then a simple partition algorithm if needed will then provide the expected result.
The reference seems to be the quick select algorithm while the reference implementation points to introselect as implemented in Numpy's partition function or C++ nth_element function.