[Python3] straightforward 2 lines with custom sort
get median by sorting and getting the (n-1)/2 th element\n2. use lambda to do custom sort. since we need maximum, take negative of difference. if difference is 
1. get median by sorting and getting the `(n-1)/2` th element\n2. use lambda to do custom sort. since we need maximum, take negative of difference. if difference is equal, we just get the larger value element\n\n```\nclass Solution:\n    def getStrongest(self, arr: List[int], k: int) -> List[int]:\n        m = sorted(arr)[(len(arr) - 1) // 2]\n        return sorted(arr, key = lambda x: (-abs(x - m), -x))[:k]\n```\n\nSuggestion by @Gausstotle that makes sorting even easier to understand:\n\n```\nclass Solution:\n    def getStrongest(self, arr: List[int], k: int) -> List[int]:\n        m = sorted(arr)[(len(arr) - 1) // 2]\n        return sorted(arr, reverse=True, key = lambda x: (abs(x - m), x))[:k]\n```\n
['Python3']