#1029
Two City Scheduling
pupil · 585 · lc medium +29 · verified · 68.4% accepted · 4,873 likes · top 75%
Description
A company needs to fly 2n people to two cities, sending exactly n to each. Given costs[i] = [aCosti, bCosti], the cost to fly person i to city A or city B respectively, return the minimum total cost.
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.
Example 2:
The total minimum cost is 10 + 30 + 50 + 20 = 110 to have half the people interviewing in each city.
Example 3:
Input: costs = [[259,770],[448,54],[926,667],[184,139],[840,118],[577,469]]
Output: 1859
Example 4:
Input: costs = [[515,563],[451,713],[537,709],[343,819],[855,779],[457,60],[650,359],[631,42]]
Output: 3086
Code
1
2
3