Python solution (2 lines) 100% faster runtime
\n\n    def getStrongest(self, arr: List[int], k: int) -> List[int]:\n        med = sorted(arr[(len(arr)-1)//2])\n \xA0 \xA0 \xA0 \xA0return sorted(array, key=l
\n```\n    def getStrongest(self, arr: List[int], k: int) -> List[int]:\n        med = sorted(arr[(len(arr)-1)//2])\n \xA0 \xA0 \xA0 \xA0return sorted(array, key=lambda x:(abs(x-med),x))[-k:]\n```
['Sorting', 'Python', 'Python3']