
#![allow(dead_code)]

struct Solution;

impl Solution {
    pub fn two_city_sched_cost(mut costs: Vec<Vec<i32>>) -> i32 {
        // Since we want to fly half the people to city A and the other half
        // to city B (in the cheapest way possible), we can sort the costs
        // array by the gains of flying people to city A over flying them
        // to city B. This can be achieved with cost[i][0] - cost[i][1]. If the