leetcode_2160

Author: KeremTAN

2160_Minimum_Sum_of_Four_Digit_Number_After_Splitting_Digits.cpp

@@ -0,0 +1,11 @@
+class Solution {
+public:
+    int minimumSum(int num) {
+        vector<int> v={num%10};
+        
+        while( num/=10){
+            v.insert(lower_bound(v.begin(), v.end(), num%10), num%10);
+        }   
+        return (v[0]*10+v[3]) + (v[1]*10 +v[2]);
+    }
+};