Java solution
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```java []\nclass Solution {\n    int minSum = Integer.MAX_VALUE;\n    public int minimumSum(int[] nums) {\n        for (int i = 0; i < nums.length - 2; i++) {\n            for (int j = i + 1; j < nums.length - 1; j++) {\n                for (int k = j + 1; k < nums.length; k++) {\n                    if (nums[i] < nums[j] && nums[k] < nums[j]) {\n                        int sum = nums[i] + nums[j] + nums[k];\n                        minSum = Math.min(minSum, sum);\n                    }\n                }\n            }\n        }\n        if (minSum == Integer.MAX_VALUE) return -1;\n        return minSum; \n    }\n}\n\n/*\n\n*/\n```
['Java']