先排序,之后看第i个人和第i+k-1个人分数的差值,取最小值即可
class Solution {
public:
int minimumDifference(vector<int>& nums, int k) {
sort(nums.begin(), nums.end());
int m = 1e6;
for(int i = 0; i + k - 1 < nums.size(); ++ i) {
m = min(m, nums[i + k - 1] - nums[i]);
}
return m;
}
};