Java - better than 92%, Clean solution
\npublic int[] getStrongest(int[] arr, int k) {\n        int n = arr.length;\n        Arrays.sort(arr);\n        int median = arr[((n - 1) / 2)];\n        \n   
```\npublic int[] getStrongest(int[] arr, int k) {\n        int n = arr.length;\n        Arrays.sort(arr);\n        int median = arr[((n - 1) / 2)];\n        \n        int[] output = new int[k];\n        int index = 0;\n        int l = 0, r = n - 1;\n        \n        while (index < k) {\n            int dist1 = Math.abs(arr[l] - median);\n            int dist2 = Math.abs(arr[r] - median);\n            \n            if (dist1 > dist2) \n                output[index++] = arr[l++];\n            else\n                output[index++] = arr[r--];\n        }\n        \n        return output;\n    }\n```
[]