Class Solution
java.lang.Object
g1001_1100.s1029_two_city_scheduling.Solution
1029 - Two City Scheduling.<p>Medium</p>
<p>A company is planning to interview <code>2n</code> people. Given the array <code>costs</code> where <code>costs[i] = [aCost<sub>i</sub>, bCost<sub>i</sub>]</code>, the cost of flying the <code>i<sup>th</sup></code> person to city <code>a</code> is <code>aCost<sub>i</sub></code>, and the cost of flying the <code>i<sup>th</sup></code> person to city <code>b</code> is <code>bCost<sub>i</sub></code>.</p>
<p>Return <em>the minimum cost to fly every person to a city</em> such that exactly <code>n</code> people arrive in each city.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> costs = [[10,20],[30,200],[400,50],[30,20]]</p>
<p><strong>Output:</strong> 110</p>
<p><strong>Explanation:</strong></p>
<p>The first person goes to city A for a cost of 10.</p>
<p>The second person goes to city A for a cost of 30.</p>
<p>The third person goes to city B for a cost of 50.</p>
<p>The fourth person goes to city B for a cost of 20.</p>
<p>The total minimum cost is 10 + 30 + 50 + 20 = 110 to have half the people interviewing in each city.</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> costs = [[259,770],[448,54],[926,667],[184,139],[840,118],[577,469]]</p>
<p><strong>Output:</strong> 1859</p>
<p><strong>Example 3:</strong></p>
<p><strong>Input:</strong> costs = [[515,563],[451,713],[537,709],[343,819],[855,779],[457,60],[650,359],[631,42]]</p>
<p><strong>Output:</strong> 3086</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>2 * n == costs.length</code></li>
<li><code>2 <= costs.length <= 100</code></li>
<li><code>costs.length</code> is even.</li>
<li><code>1 <= aCost<sub>i</sub>, bCost<sub>i</sub> <= 1000</code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
twoCitySchedCost
public int twoCitySchedCost(int[][] costs)
-