406. Queue Reconstruction by Height

https://leetcode.com/problems/queue-reconstruction-by-height/solution/

Python

class Solution:
    def reconstructQueue(self, people: List[List[int]]) -> List[List[int]]:
        people.sort(key=lambda p: (-p[0], p[1]))

        queue = []
        for p in people:
            queue.insert(p[1], p)
        return queue