class Solution { //java
public int[][] reconstructQueue(int[][] people) {
Arrays.sort(people, new Comparator<int[]>(){
public int compare(int[] p1, int[] p2) {
if (p1[0] != p2[0]) {
return p2[0] - p1[0];
} else {
return p1[1] - p2[1];
}
}
});
List<int[]> ans = new ArrayList<int[]>();
for (int[] person : people) {
ans.add(person[1], person);
}
return ans.toArray(new int[ans.size()][]);
}
}