Easy C++ 2 liner code
Complexity\n- Time complexity:O(nlogn)\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# 
# Complexity\n- Time complexity:$$O(nlogn)$$\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        return min(min(nums[nums.size()-1]-nums[2],nums[nums.size()-3]-nums[0]),nums[nums.size()-2]-nums[1]);\n    }\n};\n// [1,1,3,4,5,8]\n// [1,4,5,7,8]\n// [8,28,42,58,75]\n```
['Greedy', 'Sorting', 'C++']