class Solution {
public:
int minimumDifference(vector<int>& nums, int k) {
sort(nums.begin(),nums.end());
int minD = INT_MAX;
for(int i = 0;i < nums.size()-k+1;i++){
int d = nums[i+k-1] - nums[i];
if(d < minD){
minD = d;
}
}
return minD;
}
};