basic maths, stl
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(int num) {\n        string s= to_string(num);\n        sort(s.begin(), s.end());\n        \n        int n1= (s[0]-\'0\')*10 + (s[3]-\'0\');\n        int n2= (s[1]-\'0\')*10 + (s[2]-\'0\');\n\n        return (n1+n2);        \n    }\n};\n```
['C++']