feat: add cpp solution to lc problem: No.1029 (doocs#772)

No.1029.Two City Scheduling

Author: Dhoni77

solution/1000-1099/1029.Two City Scheduling/README.md

@@ -108,6 +108,25 @@ func twoCitySchedCost(costs [][]int) int {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int twoCitySchedCost(vector<vector<int>>& costs) {
+        sort(costs.begin(), costs.end(), [](const std::vector<int> &a, const std::vector<int> &b) {
+            return a[0] - a[1] < (b[0] - b[1]);
+        });
+        int ans = 0;
+        int n = costs.size() >> 1;
+        for (int i = 0; i < n; ++i) {
+            ans += costs[i][0] + costs[i + n][1];
+        }
+        return ans;
+    }
+};
+```
+
 ### **...**
 
 ```

solution/1000-1099/1029.Two City Scheduling/README_EN.md

@@ -96,6 +96,25 @@ func twoCitySchedCost(costs [][]int) int {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int twoCitySchedCost(vector<vector<int>>& costs) {
+        sort(costs.begin(), costs.end(), [](const std::vector<int> &a, const std::vector<int> &b) {
+            return a[0] - a[1] < (b[0] - b[1]);
+        });
+        int ans = 0;
+        int n = costs.size() >> 1;
+        for (int i = 0; i < n; ++i) {
+            ans += costs[i][0] + costs[i + n][1];
+        }
+        return ans;
+    }
+};
+```
+
 ### **...**
 
 ```

solution/1000-1099/1029.Two City Scheduling/Solution.cpp

@@ -0,0 +1,14 @@
+class Solution {
+public:
+    int twoCitySchedCost(vector<vector<int>>& costs) {
+        sort(costs.begin(), costs.end(), [](const std::vector<int> &a, const std::vector<int> &b) {
+            return a[0] - a[1] < (b[0] - b[1]);
+        });
+        int ans = 0;
+        int n = costs.size() >> 1;
+        for (int i = 0; i < n; ++i) {
+            ans += costs[i][0] + costs[i + n][1];
+        }
+        return ans;
+    }
+};