class Solution {

public int[][] allCellsDistOrder(int R, int C, int r0, int c0) {

int[][] points = new int[R * C][2];

Queue<int[]> queue = new LinkedList<>();

int idx = 0;

queue.add(new int[]{r0, c0});

boolean[][] visited = new boolean[R][C];

while (!queue.isEmpty()) {

int[] curr = queue.poll();

int r = curr[0];

int c = curr[1];

if (r < 0 || r >= R || c < 0 || c >= C || visited[r][c]) {

continue;

}

points[idx++] = curr;

visited[r][c] = true;

queue.add(new int[]{r, c - 1});

queue.add(new int[]{r, c + 1});

queue.add(new int[]{r - 1, c});

queue.add(new int[]{r + 1, c});

}

return points;

}

}

class Solution {

public int twoCitySchedCost(int[][] costs) {

Arrays.sort(costs, new Comparator<int[]>() {

@Override

public int compare(int[] o1, int[] o2) {

return o1[0] - o1[1] - (o2[0] - o2[1]);

}

});

int total = 0;

for (int i = 0; i < costs.length; i++) {

if (i < costs.length / 2) {

total += costs[i][0];

}

else {

total += costs[i][1];

}

}

return total;

}

}