Two City Scheduling

A company is planning to interview 2n people. Given the array costs where costs[i] = [aCosti, bCosti], the cost of flying the ith person to city a is aCosti, and the cost of flying the ith person to city b is bCosti.

Return the minimum cost to fly every person to a city such that exactly n people arrive in each city.

Example 1:

Input: costs = [[10,20],[30,200],[400,50],[30,20]]
Output: 110
Explanation: 
The first person goes to city A for a cost of 10.
The second person goes to city A for a cost of 30.
The third person goes to city B for a cost of 50.
The fourth person goes to city B for a cost of 20.

The total minimum cost is 10 + 30 + 50 + 20 = 110 to have half the people interviewing in each city.

Example 2:

Input: costs = [[259,770],[448,54],[926,667],[184,139],[840,118],[577,469]]
Output: 1859

Example 3:

Input: costs = [[515,563],[451,713],[537,709],[343,819],[855,779],[457,60],[650,359],[631,42]]
Output: 3086

Constraints:

• 2 * n == costs.length
• 2 <= costs.length <= 100
• costs.length is even.
• 1 <= aCosti, bCosti <= 1000

思路：这个题一看就是个DP，dp[i][j] 代表的是，i个person 去A，j个person去B的cost；

dp[i][j] = dp[i - 1][j] + costs[i + j - 1][0] , dp[i][j - 1] + cost[i + j - 1][1];

class Solution {
    public int twoCitySchedCost(int[][] costs) {
        int n = costs.length;
        int N = n / 2;
        int[][] dp = new int[N + 1][N + 1];
        // dp[i][j]: i person go to A, j person go to B, minimum cost;
        // 1st row;
        for(int j = 1; j <= N; j++) {
            dp[0][j] = dp[0][j - 1] + costs[j - 1][1];
        }
        
        // 1st col;
        for(int i = 1; i <= N; i++) {
            dp[i][0] = dp[i - 1][0] + costs[i - 1][0];
        }
        
        // calculate matrix;
        for(int i = 1; i <= N; i++) {
            for(int j = 1; j <= N; j++) {
                dp[i][j] = Math.min(dp[i - 1][j] + costs[i + j - 1][0],
                                   dp[i][j - 1] + costs[i + j - 1][1]);
            }
        }
        return dp[N][N];
    }
}

思路2：[Acost, Bcost] 如果算Acost - Bcost，如果是负数代表走到B划不来，如果是正数代表走到A不合算，那么我按照这个diff来从小到大sort，那么前半段全部是走到B划不来的，我全部走A，后半段全部是走A划不来的，我全部走B；

class Solution {
    public int twoCitySchedCost(int[][] costs) {
        Arrays.sort(costs, (a, b) -> (a[0] - a[1]) - (b[0] - b[1]));
        int cost = 0;
        for(int i = 0; i < costs.length / 2; i++) {
            cost += costs[i][0];
        }
        for(int i = costs.length / 2; i < costs.length; i++) {
            cost += costs[i][1];
        }
        return cost;        
    }
}