题目
Suppose you have a random list of people standing in a queue. Each person is described by a pair of integers (h, k), where h is the height of the person and k is the number of people in front of this person who have a height greater than or equal to h. Write an algorithm to reconstruct the queue.
Note: The number of people is less than 1,100.
解题思路
贪心，按照身高从高到低排序，身高相同则按位置从小到大排序，因为无论矮的人排在哪里，都不会影响高的人，所以就按照排序的结果，按顺序把每个人插入到相应的位置
代码
class Solution:
def reconstructQueue(self, people: List[List[int]]) -> List[List[int]]:
people.sort(key = lambda x: (-x[0], x[1]))
res = []
for p in people:
res.insert(p[1], p)
return res
