public class Solution {

     public int[][] reconstructQueue(int[][] people) {

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

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

                 return o1[0] == o2[0]? o1[1] - o2[1] : o2[0] - o1[0];

             }

         });

         List<int[]> pList = new ArrayList<int[]>();

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

             pList.add(people[i][1], new int[]{people[i][0], people[i][1]});

         }

         int[][] ans = new int[people.length][2];

         for (int i = 0; i < pList.size(); i++) {

             ans[i] = pList.get(i);

         }

         return ans;

     }

 }