Minimum Difference Between Highest and Lowest of K Scores LeetCode solution in C++

1
class Solution {
2
 public:
3
  int minimumDifference(vector<int> &nums, int k) {
4
    sort(nums.begin(), nums.end());
5
    int res = nums[k - 1] - nums[0];
6
    for (int i = k; i < nums.size(); i++) res = min(res, nums[i] - nums[i - k + 1]);
7
    return res;
8
  }
9
};