Easy Approach using C
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
```c []
int minimumSum(int* nums, int numsSize) {
    int min_sum=INT_MAX;
    for(int i=0;i<numsSize-2;i++){
        for(int j=i+1;j<numsSize-1;j++){
            for(int k=j+1;k<numsSize;k++){
                if(nums[i]<nums[j] && nums[k]<nums[j]){
                    int sum=nums[i]+nums[j]+nums[k];
                    if(min_sum>sum){
                    min_sum=sum;
                }
                }
                
            }
        }
    }
    return (min_sum==INT_MAX)?-1:min_sum;
}
```
['C']