class Solution:
    def reconstructQueue(self, people: List[List[int]]) -> List[List[int]]:
        n = len(people)
        people.sort()
        ordered = [None] * n

        for person in people:
            h, k = person
            skip = k

            for i in range(0, n):
                if not ordered[i]:
                    if skip == 0:
                        ordered[i] = [h, k]
                        break
                    else:
                        skip -= 1
                elif ordered[i][0] >= h:
                    skip -= 1
        return ordered