1
class Solution:
2
    def reconstructQueue(self, people: List[List[int]]) -> List[List[int]]:
3
        n = len(people)
4
        people.sort()
5
        ans = [[]] * n
6
        i = 0
7
        while people:
8
            h, p = people.pop(0)
9
            count = p
10
            for i in range(n):
11
                if count == 0 and ans[i] == []:
12
                    ans[i] = [h, p]
13
                    break
14

15
                elif not ans[i] or (ans[i] and ans[i][0] >= h):
16
                    count -= 1
17
        return ans