Easy
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```python3 []\nclass Solution:\n    def minimumSum(self, nums: List[int]) -> int:\n        minSum=100000000000\n        n=len(nums)\n        # print(float(\'inf\'))\n        for i in range(n):\n            for j in range(i+1,n):\n                if nums[i]<nums[j]:\n                    for k in range(j+1,n):\n                        if nums[k]<nums[j]:\n                            s=nums[i]+nums[j]+nums[k]\n                            if s<minSum:\n                                minSum=s\n        \n        return -1 if  minSum==100000000000 else minSum\n        \n```
['Python3']