-
Notifications
You must be signed in to change notification settings - Fork 2
/
TwoCityScheduling.java
78 lines (71 loc) · 2.39 KB
/
TwoCityScheduling.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
package Leetcode;
import java.util.Arrays;
/**
* @author kalpak
*
* 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.
*
* Example 2:
* Input: costs = [[259,770],[448,54],[926,667],[184,139],[840,118],[577,469]]
* Output: 1859
*
* Example 3:
* Input: costs = [[515,563],[451,713],[537,709],[343,819],[855,779],[457,60],[650,359],[631,42]]
* Output: 3086
*
* Constraints:
*
* 2 * n == costs.length
* 2 <= costs.length <= 100
* costs.length is even.
* 1 <= aCosti, bCosti <= 1000
*/
public class TwoCityScheduling {
public static int twoCitySchedCost(int[][] costs) {
// Reduce Cost is equal to Maximizing Profit
Arrays.sort(costs, (a, b) -> Math.abs(b[0] - b[1]) - Math.abs(a[0] - a[1]));
int result = 0;
int numberOfPeopleAllowed = costs.length / 2;
int countCity1 = 0;
int countCity2 = 0;
for(int i = 0; i < costs.length; i++) {
if(costs[i][0] <= costs[i][1]) {
if(countCity1 < numberOfPeopleAllowed) {
result += costs[i][0];
countCity1++;
} else {
result += costs[i][1];
countCity2++;
}
} else {
if(countCity2 < numberOfPeopleAllowed) {
result += costs[i][1];
countCity2++;
} else {
result += costs[i][0];
countCity1++;
}
}
}
return result;
}
public static void main(String[] args) {
int[][] costs = new int[][]{{259,770},{448,54},{926,667},{184,139},{840,118},{577,469}};
System.out.println(twoCitySchedCost(costs));
}
}