Question 1029 has been solved.

Author: pinarkizilarslan

Q-1029 - Two City Scheduling/1029.cpp

@@ -0,0 +1,21 @@
+bool compare(vector<int>& a, vector<int>& b){
+    return a[0]-a[1] < b[0]-b[1];
+}
+
+class Solution {
+public:
+    int twoCitySchedCost(vector<vector<int>>& costs) {
+        
+        int minSum=0;
+        sort(costs.begin(), costs.end(), compare);        
+        
+        for(int i=0;i<costs.size();i++){
+            if(i<costs.size()/2)
+                minSum+=costs[i][0];
+            else
+                minSum+=costs[i][1];
+        }
+        
+        return minSum;
+    }
+};

Q-1029 - Two City Scheduling/1029.py

@@ -0,0 +1,13 @@
+class Solution:
+    def twoCitySchedCost(self, costs: List[List[int]]) -> int:
+        
+        minSum = 0
+        costs = sorted(costs, key=lambda interval: interval[0] - interval[1])     
+        
+        for i in range(len(costs)):
+            if(i<len(costs)/2) :
+                minSum+=costs[i][0]
+            else :
+                minSum+=costs[i][1]        
+        
+        return minSum