shivam kumar
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```cpp []
class Solution {
public:
    int minimumSum(vector<int>& nums) {
        int n=nums.size();
        int sum=INT_MAX;
        for(int i=0;i<n-2;i++){
            for(int j=i+1;j<n-1;j++){
                for(int k=j+1;k<n;k++){
                    if((nums[i]<nums[j]) && (nums[k]<nums[j])){
                        sum=min(sum,nums[i]+nums[j]+nums[k]);
                    }
                }
            }
        }
        if(sum==INT_MAX){
            return -1;
        }
        return sum;
    }
};
```
['C++']