Queue Reconstruction by Height

Given pairs (h, k) where k is the number of people with height >= h standing in front of that person, reconstruct the queue ordering that satisfies all constraints. This is a greedy/reconstruction problem typically solved by processing taller people first and inserting each person at position k to preserve the counts.