C++ || 3 Choices Sort
\nclass Solution {\npublic:\n    int minimizeSum(vector<int>& nums) {\n        if(nums.size()<=3) return 0;\n        \n        vector<int> first,middle;\n      
```\nclass Solution {\npublic:\n    int minimizeSum(vector<int>& nums) {\n        if(nums.size()<=3) return 0;\n        \n        vector<int> first,middle;\n        sort(nums.begin(),nums.end());\n        first = nums;\n        middle = nums;\n        \n        nums[0] = nums[2];\n        nums[1] = nums[2];\n        int ans1 = nums.back()-nums[0];\n        \n        first[first.size()-1] = first[0];\n        first[first.size()-2] = first[0];\n        sort(first.begin(),first.end());\n        int ans2 = first.back()-first[0];\n        \n        \n        middle[middle.size()-1] = middle[1];\n        middle[0] = middle[1];\n        sort(middle.begin(),middle.end());\n        int ans3 = middle.back()-middle[0];\n        \n        \n        return min(ans1,min(ans2,ans3));\n        \n    }\n};\n```
['C', 'Sorting', 'C++']