There are 2N
people a company is planning to interview. The cost of flying the i
-th person to city A
is costs[i][0]
, and the cost of flying the i
-th person to city B
is costs[i][1]
.
Return the minimum cost to fly every person to a city such that exactly N
people arrive in each city.
Example 1:
Input: [[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.
Note:
1 <= costs.length <= 100
- It is guaranteed that
costs.length
is even. 1 <= costs[i][0], costs[i][1] <= 1000
理解:把2N个人,N个送去A城市,剩下N个送去B城市。
class Solution {
public:
int twoCitySchedCost(vector<vector<int>>& costs) {
sort(begin(costs), end(costs),
[](const vector<int> &o1, const vector<int> &o2) { //比较器,去掉const速度更快
return (o1[0] - o1[1] < o2[0] - o2[1]);
});
int total = 0;
int n = costs.size() / 2;
for (int i = 0; i < n; ++i)
total += costs[i][0] + costs[i + n][1]; //巧妙之处
return total;
}
};
Python:
class Solution:
def twoCitySchedCost(self, costs: List[List[int]]) -> int:
costs.sort(key=lambda x:x[0]-x[1])
N=len(costs)//2
total=0
for i in range(N):
total+=costs[i][0]+costs[i+N][1]
return total