1029-two-city-scheduling.java

class Solution {
    public int twoCitySchedCost(int[][] costs) {
        Arrays.sort(costs, 
            (a, b) -> (a[1] - a[0]) - (b[1] - b[0])
        );

        int n = costs.length / 2;
        int total = 0;
        for (int i = 0; i < n; i++) { 
            total += costs[i][1] + costs[i + n][0];
        }

        return total;
    }
}