Simple Python Solution
\nclass Solution:\n    # Time: O(n*log(n))\n    # Space: O(n)\n    def getStrongest(self, arr: List[int], k: int) -> List[int]:\n        arr.sort()\n        med
```\nclass Solution:\n    # Time: O(n*log(n))\n    # Space: O(n)\n    def getStrongest(self, arr: List[int], k: int) -> List[int]:\n        arr.sort()\n        median = arr[(len(arr) - 1)//2]\n        res, i, j = [], 0, len(arr) - 1\n        while i <= j and k:\n            if abs(arr[i] - median) > abs(arr[j] - median):\n                res.append(arr[i])\n                i += 1\n            else:\n                res.append(arr[j])\n                j -= 1       \n            k -= 1\n        return res\n```
['Sorting', 'Python']