1
class Solution {
2
 public:
3
  int smallestRangeI(vector<int> &nums, int k) {
4
    int mx = *max_element(nums.begin(), nums.end());
5
    int mn = *min_element(nums.begin(), nums.end());
6

7
    return max(0, (mx - mn - 2 * k));
8
  }
9
};