1029. Two City Scheduling Medium

1/**
2 * [1029] Two City Scheduling
3 *
4 * A company is planning to interview 2n people. Given the array costs where costs[i] = [aCosti, bCosti], the cost of flying the i^th person to city a is aCosti, and the cost of flying the i^th person to city b is bCosti.
5 * Return the minimum cost to fly every person to a city such that exactly n people arrive in each city.
6 *  
7 * Example 1:
8 * 
9 * Input: costs = [[10,20],[30,200],[400,50],[30,20]]
10 * Output: 110
11 * Explanation: 
12 * The first person goes to city A for a cost of 10.
13 * The second person goes to city A for a cost of 30.
14 * The third person goes to city B for a cost of 50.
15 * The fourth person goes to city B for a cost of 20.
16 * The total minimum cost is 10 + 30 + 50 + 20 = 110 to have half the people interviewing in each city.
17 * 
18 * Example 2:
19 * 
20 * Input: costs = [[259,770],[448,54],[926,667],[184,139],[840,118],[577,469]]
21 * Output: 1859
22 * 
23 * Example 3:
24 * 
25 * Input: costs = [[515,563],[451,713],[537,709],[343,819],[855,779],[457,60],[650,359],[631,42]]
26 * Output: 3086
27 * 
28 *  
29 * Constraints:
30 * 
31 * 	2 * n == costs.length
32 * 	2 <= costs.length <= 100
33 * 	costs.length is even.
34 * 	1 <= aCosti, bCosti <= 1000
35 * 
36 */
37pub struct Solution {}
38
39// problem: https://leetcode.com/problems/two-city-scheduling/
40// discuss: https://leetcode.com/problems/two-city-scheduling/discuss/?currentPage=1&orderBy=most_votes&query=
41
42// submission codes start here
43
44impl Solution {
45    pub fn two_city_sched_cost(costs: Vec<Vec<i32>>) -> i32 {
46        0
47    }
48}
49
50// submission codes end
51
52#[cfg(test)]
53mod tests {
54    use super::*;
55
56    #[test]
57    fn test_1029() {
58    }
59}
60