C solution
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: O(1)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nint minimumSum(int num) \n{\n    int digits[4];\n    for(int i = 0; i < 4; i++)\n    {\n        digits[i] = num % 10;\n        num /= 10;\n    }\n    for(int i = 0; i < 3; i++)\n    {\n        for(int j = 3; j > i; j--)\n        {\n            if(digits[j] < digits[j - 1])\n            {\n                int tmp = digits[j];\n                digits[j] = digits[j - 1];\n                digits[j - 1] = tmp;\n            }\n        }\n    }\n    return (digits[0] + digits[1]) * 10 + digits[2] + digits[3]; \n}\n```
['C']