Short Python Time O(nlogn)
\nclass Solution:\n    def getStrongest(self, arr: List[int], k: int) -> List[int]:\n        if k == 0 or not arr:\n            return []\n        \n        n =
```\nclass Solution:\n    def getStrongest(self, arr: List[int], k: int) -> List[int]:\n        if k == 0 or not arr:\n            return []\n        \n        n = len(arr)\n        arr.sort()\n        median = arr[(n - 1) // 2]\n        \n        abs_arr = sorted(arr, key=lambda x: (abs(x - median), x), reverse=True)\n        \n        return abs_arr[:k]\n        \n```
[]