Problem_0908_smallestRangeI.cc

#include <algorithm>
#include <vector>

using namespace std;

class Solution
{
 public:
  int smallestRangeI(vector<int>& nums, int k)
  {
    int max = *max_element(nums.begin(), nums.end());
    int min = *min_element(nums.begin(), nums.end());
    return max - min - 2 * k <= 0 ? 0 : max - min - 2 * k;
  }
};