1
class Solution:
2
    def getStrongest(self, arr: List[int], k: int) -> List[int]:
3
        arr.sort()
4
        mid = arr[(len(arr) - 1) // 2]
5
        ans = []
6
        l, r = 0, len(arr) - 1
7
        while l <= r:
8
            if abs(arr[l] - mid) > abs(arr[r] - mid):
9
                ans.append(arr[l])
10
                l += 1
11
            else:
12
                ans.append(arr[r])
13
                r -= 1
14
        return ans[:k]