CPP||100%BEATS
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```\n\nclass Solution {\npublic:\n    int minimumSum(int num) {\n        //array for store the retrived element\n        vector<int> nums;\n        //retriving one by one number of num \n        while(num>0)\n        {\n            nums.push_back(num%10);\n            num=num/10;\n        }\n        //here sorting the array\n        sort(nums.begin(),nums.end());\n        return nums[0]*10+nums[2]+nums[1]*10+nums[3];\n    }\n};\n```
['C++']