C++ simple straightforward solution . Beast 100% User with 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        vector<int>v;\n        while(num){\n            v.push_back(num%10);\n            num/=10;\n        }\n        sort(v.begin(),v.end());\n        return v[0]*10+v[2] + v[1]*10+v[3];\n    }\n};\n```
['C++']