#using a sliding window on a reverse sorted array
def maxMin(k, arr):
    # Write your code here
    sorted_arr = sorted(arr,reverse=True)
    current_window=[]
    mini=max(arr)
    for end in range(len(sorted_arr)):
        current_window.append(sorted_arr[end])
        if len(current_window)==k:
            diff=current_window[0]-current_window[k-1]
            if diff<mini:
                mini=diff
            current_window.pop(0)
    return mini

public static int maxMin(int k, List<int> arr)
    {
        arr.Sort();
        int lowestFairness = arr[arr.Count()-1] - arr[0];
        
        for(int i = 0; (i + k - 1) < arr.Count(); i++){
            if(lowestFairness > (arr[i + k - 1] - arr[i]))
                lowestFairness = arr[i + k - 1] - arr[i];
        }
        
        return lowestFairness;
    }

function maxMin(k: number, arr: number[]): number {
    const sortedArray = [...arr].sort((a ,b) => a - b);
    let minimumUnfairness = Number.POSITIVE_INFINITY;
    
    for (let i = 0; i <= sortedArray.length - k; i++) {
        const unfairness = Math.abs(sortedArray[i] - sortedArray[i + k - 1])
        if (unfairness < minimumUnfairness) {
            minimumUnfairness = unfairness;
        }
    }
    return minimumUnfairness
}

def maxMin(k, arr):
    arr.sort()
    unfairness = arr[-1] - arr[0]
    for i in range(len(arr)-k+1):
        if arr[i+k-1] - arr[i] < unfairness:
            unfairness = arr[i+k-1] - arr[i]
    return unfairness