[Java] Without PriorityQueue, it can be faster. 100%, 100%!
\nclass Solution {\n    public int[] getStrongest(int[] arr, int k) {\n        Arrays.sort(arr);                \n        int[] result = new int [k];\n        i
```\nclass Solution {\n    public int[] getStrongest(int[] arr, int k) {\n        Arrays.sort(arr);                \n        int[] result = new int [k];\n        int lo = 0, hi = arr.length - 1;\n        int m = arr[hi / 2];\n        for (int i = 0; i < k; ++ i) {\n            int diff = Math.abs(arr[lo] - m) - Math.abs(arr[hi] - m);\n            if (diff <= 0) {\n                result[i] = arr[hi -- ];\n            } else {\n                result[i] = arr[lo ++];\n            }\n        }\n        return result;\n    }\n}\n```
['Java']