Python Sort using Lambda 100% Faster
\nclass Solution:\n    def getStrongest(self, arr: List[int], k: int) -> List[int]:\n        arr.sort()\n        n = len(arr)\n        m = arr[(n-1)//2]  # Comp
```\nclass Solution:\n    def getStrongest(self, arr: List[int], k: int) -> List[int]:\n        arr.sort()\n        n = len(arr)\n        m = arr[(n-1)//2]  # Compute median\n        arr.sort(key=lambda x:(-abs(x-m),-x))  \n        return arr[:k]\n```
[]