lazy java solution
```\nclass Solution {\n    public int[] getStrongest(int[] arr, int k) {\n        Arrays.sort(arr);\n        int n = arr.length, mid = arr[(n - 1) / 2];\n      
```\nclass Solution {\n    public int[] getStrongest(int[] arr, int k) {\n        Arrays.sort(arr);\n        int n = arr.length, mid = arr[(n - 1) / 2];\n        int[][] tmp = new int[n][2];\n        for(int i = 0; i < n; i++)\n            tmp[i] = new int[]{Math.abs(arr[i] - mid), i};\n        Arrays.sort(tmp, (a, b) -> b[0] == a[0] ? arr[b[1]] - arr[a[1]] : b[0] - a[0]);\n\n        int[] res = new int[k];\n        for(int i = 0; i < k; i++)\n            res[i] = arr[tmp[i][1]];\n        return res;\n    }\n}
[]