easy 3 steps solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\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    int n = nums.size();\n    int a = nums[n-3] - nums[0];\n    int b = nums[n-1] - nums[2];\n    int c = nums[n-2] - nums[1];\n    return min(a,min(b,c));\n    }\n};\n```
['C++']