Queue Reconstruction by Height

You are given a list of people described by pairs `[h, k]`, where `h` is a person's height and `k` is the number of people in front of them who are **strictly taller** than them. The list is randomly shuffled. Reconstruct the correct queue order so that every pair's `k` matches the number of taller people standing ahead of that person. Implement the function `reconstruct_queue(people: list[list[int]]) -> list[list[int]]` that returns the original queue order as a list of pairs. If multiple valid orders exist, any valid order is accepted, but the test cases expect the specific order produced by the standard greedy algorithm (described below). **Algorithm guidance:** Sort people by height descending (tallest first), and for equal heights, by `k` ascending. Then insert each person into a result list at index equal to their `k` value. This is a standard greedy approach that produces a correct queue. For example, given `[[7,0], [4,4], [7,1], [5,0], [6,1], [5,2]]`, the reconstructed queue is `[[5,0], [7,0], [5,2], [6,1], [4,4], [7,1]]`. **Input constraints:** - `0 <= len(people) <= 1000` - Heights `h` are integers from 1 to 10^9. - `k` is an integer from 0 to len(people)-1. - It is guaranteed that at least one valid reconstruction exists. Return the reconstructed queue as a list of lists.

>>> reconstruct_queue([[7,0], [4,4], [7,1], [5,0], [6,1], [5,2]])
[[5,0], [7,0], [5,2], [6,1], [4,4], [7,1]]