C++ Solution || Beats 100% || Runtime 0ms
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\n    vector<int> v;\n    while(num!=0)\n    {\n        v.push_back(num%10);\n        num=num/10;\n    }\n    sort(v.begin(),v.end());\n    int ans=v[0]*10+v[3] + v[1]*10+v[2];\n    return ans;\n\n\n    }\n};\n```
['C++']