leetcode 1029. Two City Scheduling（两地调度）

关注

原创最新推荐文章于 2026-04-29 07:15:00 发布 236 阅读 AI 写同款· GEO 优化 ›

Windows服务器XMRig挖矿病毒深度清除实战指南 XMRig是一种广泛用于Monero（XMR）加密货币挖矿的开源工具，其在Windows环境中的持久化机制已远超传统木马范畴，融合WMI事件订阅、服务伪装、PowerShell无文件执行与注册表隐写等多重反检测技术。理解其基于行为而非特征的生存逻辑，是实现有效检测与根除的前提。该技术具备强隐蔽性、高自愈性与网络通信合法化特征，常见于RDP弱口令爆破、SMB共享泄露及PowerShell远程执行等非漏洞类入侵场景。本文聚焦Windows原生命令与Sysinternals工具链，提供覆盖进程定位、WMI清理、服阅读详情

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.

给一个2n x 2的数组costs，其中costs[ i ] 为第 i 个人到城市A 和到城市B 的cost，即costs[ i ] = [costA, costB]。
要把这2n个人中的n个送到A，另外n个送到B，问最小cost。

思路：
2n个人要对半分，n个去A，n个去B。
把 costA比costB小的放在数组左边，costA比costB大的放在数组右边。

涉及到了排序。
按什么排？按costA - costB排，也就是按costs[ i ][0] - costs[ i ][ 1 ]排序。

排好序后前半段加costA，后半段加costB。

    public int twoCitySchedCost(int[][] costs) {
        int n = costs.length / 2;
        int result = 0;
        int cnt = 0;
        
        Arrays.sort(costs, (a, b) -> (a[0] - a[1] - b[0] + b[1]));
        
        for(int[] cost : costs) {
            if(cnt < n) {
                result += cost[0];
            } else {
                result += cost[1];
            }
            cnt ++;
        }
        
        return result;
    }