C++ 2 line Easy Code.
Complexity\n- Time complexity: O(n*log(n))\n Add your time complexity here, e.g. O(n) \n\n- Space complexity: O(1)\n Add your space complexity here, e.g. O(n) \
# Complexity\n- Time complexity: $$O(n*log(n))$$\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: $$O(1)$$\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int minimizeSum(vector<int>& nums) {\n        sort(nums.begin(),nums.end());\n        int n=nums.size();\n        return min({nums[n-1]-nums[2],nums[n-3]-nums[0],nums[n-2]-nums[1]});\n    }\n};\n```
['C++']