AVS
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>& a) {\n        int ans=INT_MAX,sum=0;\n           for(int i=0;i<a.size();i++){\n                   for(int j=i+1;j<a.size();j++){\n                           for(int k=j+1;k<a.size();k++){\n                                   if(a[j]>a[i]&&a[j]>a[k])\n                                   {ans=min(ans,a[i]+a[j]+a[k]);}\n                           }\n                   }\n           }\n            if(ans==INT_MAX)return -1;\n            return ans;\n    }\n};\n```
['C++']