python3 2 pointers
```\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]\n   
```\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]\n        strong = []\n        # for i in range(len(arr)):\n        i,j = 0, len(arr)-1\n        while i<=j:\n            if abs(arr[i]-m) <= abs(arr[j]-m):\n                strong.append(arr[j])\n                j -= 1\n            else:\n                strong.append(arr[i])\n                i += 1\n        return(strong[:k])
[]