BRUTE FORCE .........
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        int n= nums.size(); \n        int sol=INT_MAX;\n        for(int i=0 ; i<n-2 ;i++)\n        {\n            for(int j=i+1 ; j<n-1;j++)\n            {\n                for(int k=j+1; k<n;k++)\n                {\n                    if(nums[i] < nums[j] and nums[k] < nums[j])\n                    {\n                        int ans=nums[i]+nums[j]+nums[k];\n                        sol=min(sol,ans);\n                    }    \n                }\n            }\n        }\n        if(sol==INT_MAX)return -1;\n\n        return sol;\n    }\n};\n```
['C++']