Leetcode 910. Smallest Range II

Given an integer array and k, choose for each element either +k or -k to minimize the final difference between the maximum and minimum elements. Key insight: after sorting, optimal assignments correspond to a split where left-side elements are raised and right-side elements are lowered, so you search split points to minimize the resulting range.