Leetcode 1471. The k Strongest Values in an Array

Find the centre (the element at index (n−1)/2 of the sorted array) and return any k elements with the largest "strength", where strength = |x − centre| and ties are broken by the larger value — i.e., pick the top-k elements by distance from the centre.