From e99aa2caf8f9bdd358f31ffb47d5648aa3cb63ea Mon Sep 17 00:00:00 2001
From: Khushali Thakkar <50379093+Khushaliketan@users.noreply.github.com>
Date: Thu, 15 Oct 2020 20:29:27 +0530
Subject: [PATCH] Create 1029_Two_City_Scheduling.java

---
 Arrays/1029_Two_City_Scheduling.java | 19 +++++++++++++++++++
 1 file changed, 19 insertions(+)
 create mode 100644 Arrays/1029_Two_City_Scheduling.java

diff --git a/Arrays/1029_Two_City_Scheduling.java b/Arrays/1029_Two_City_Scheduling.java
new file mode 100644
index 00000000..c69dd7fd
--- /dev/null
+++ b/Arrays/1029_Two_City_Scheduling.java
@@ -0,0 +1,19 @@
+//Link to question: https://leetcode.com/problems/two-city-scheduling/
+
+import java.lang.Math;
+class Solution {
+    public int twoCitySchedCost(int[][] costs) {
+        int N = costs.length/2;
+        int[] refund = new int[N * 2];
+        int minCost = 0, index = 0;
+        for(int[] cost : costs){
+            refund[index++] = cost[1] - cost[0];
+            minCost += cost[0];
+        }
+        Arrays.sort(refund);
+        for(int i = 0; i < N; i++){
+            minCost += refund[i];
+        }
+        return minCost;
+    }
+}