[Python] 2-pointers solution beats 90%
python\nclass Solution:\n    def getStrongest(self, arr: List[int], k: int) -> List[int]:\n        arr.sort()\n        N = len(arr)\n        median = arr[(N-1)/
```python\nclass Solution:\n    def getStrongest(self, arr: List[int], k: int) -> List[int]:\n        arr.sort()\n        N = len(arr)\n        median = arr[(N-1)//2]\n        i,j = 0,N-1\n        res = []\n        while i<=j and len(res)<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        return res\n```
[]