Easy to understand solution using c++ || Sorting || Array
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \nAt first we will split 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\nAt first we will split num and we will store it\'s digit in vector v.\nThen we sort the vector v.\nNow the two numbers whose sum is minimum are (v[0]*10 + v[2]) and (v[1]*10 + v[3]);\n\nSo we will return the sum of these two numbers.\n\n# Complexity\n- Time complexity: O(nlogn) \n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\nComplexity of sort function is nlogn\n\n- Space complexity: O(1)\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=num/10;\n        }\n        sort(v.begin(),v.end());\n        int new1=v[0]*10 + v[2];\n        int new2=v[1]*10 + v[3];\n\n        return new1+new2;\n        \n    }\n};\n```
['Array', 'Sorting', 'C++']