// Package q1984 implements a solution for https://leetcode.com/problems/minimum-difference-between-highest-and-lowest-of-k-scores/
package q1984

import (
	"math"
	"slices"
)

func minimumDifference(nums []int, k int) int {
	slices.Sort(nums)
	minDiff := math.MaxInt
	for i := 0; i < len(nums)-k+1; i++ {
		minDiff = min(nums[i+k-1]-nums[i], minDiff)
	}
	return minDiff
}

var _ = minimumDifference