_1471.java

packagecom.fishercoder.solutions.secondthousand;

importjava.util.ArrayList;
importjava.util.Arrays;
importjava.util.Collections;
importjava.util.List;
importjava.util.TreeMap;

publicclass_1471 {
publicstaticclassSolution1 {
publicint[] getStrongest(int[] arr, intk) {
Arrays.sort(arr);
intmedian = arr.length % 2 != 0 ? arr[arr.length / 2] : arr[arr.length / 2 - 1];
TreeMap<Integer, List<Integer>> treeMap = newTreeMap<>(Collections.reverseOrder());
for (intnum : arr) {
intdiff = Math.abs(num - median);
if (!treeMap.containsKey(diff)) {
treeMap.put(diff, newArrayList<>());
 }
treeMap.get(diff).add(num);
 }
List<Integer> sorted = newArrayList<>();
for (intkey : treeMap.keySet()) {
List<Integer> sort = treeMap.get(key);
Collections.sort(sort, Collections.reverseOrder());
sorted.addAll(sort);
 }
int[] result = newint[k];
for (inti = 0; i < k; i++) {
result[i] = sorted.get(i);
 }
returnresult;
 }
 }
}