C++
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:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int minimumSum(vector<int>& nums) {\n        \n        \n        int ans = INT_MAX;\n        for(int i = 0;i < nums.size();i++)\n        {\n            for(int j = i + 1; j < nums.size();j++)\n            {\n                for(int k = j + 1;k < nums.size();k++)\n                {\n                    if(nums[i] < nums[j] and nums[j] > nums[k])\n                    {\n                        ans = min(ans, nums[i] + nums[j] + nums[k]);\n                    }\n                }\n            }\n        }\n        \n        if(ans == INT_MAX)\n        {\n            return -1;\n        }\n        return ans;\n    }\n};\n```
['C++']