public static int maxMin(int k, List<Integer> arr) {
        int currentUnfairness = 0;
        int minUnfairness = Integer.MAX_VALUE;
        
        List <Integer> sortedArr = arr.stream().sorted().collect(Collectors.toList());
        
        for (int i = 0, j = k - 1; j < sortedArr.size(); i++, j++) {
            currentUnfairness = sortedArr.get(j) - sortedArr.get(i);
            minUnfairness = Math.min(minUnfairness, currentUnfairness);
        }
        
        return minUnfairness;
    }

    public static int maxMin(int k, List<Integer> arr) {
    // Write your code here
        arr.sort(Comparator.naturalOrder());
        int result = Integer.MAX_VALUE;
        for (int i = 0; i <= arr.size() - k; i++) {
            result = Math.min(result, arr.get(i + k - 1) - arr.get(i)); 
        }
        return result;
    }

fun maxMin(k: Int, arr: Array<Int>): Int {
    arr.sort()
    return (0..arr.size - k).minOf { i -> arr[i + k - 1] - arr[i] }
}

int maxMin(int k, vector<int> arr) {
    int res = INT_MAX;
    std::sort(arr.begin(), arr.end());
    for(int i = 0; i + k -1 < arr.size(); ++i){
        res = std::min(res, arr[i+k-1] - arr[i]);
    }
    return res;
}