leetcode 406重新排队（高个子看不到矮个子，高个子先排队，矮子再插队对于结果没有影响，对于矮子来说，只有比他高或者和他一样高的人排在他前面才有相对意义）

题目：
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.

Example

Input:
[[7,0], [4,4], [7,1], [5,0], [6,1], [5,2]]

Output:
[[5,0], [7,0], [5,2], [6,1], [4,4], [7,1]]
题解：
排序+插队
people.sort(key=lambda (h,k)?-h,k))
queue=[]
for p in people:
queue.insert(p[1],p)
return queue
详细解析请看下面：https://leetcode.com/problems/queue-reconstruction-by-height/discuss/89359/Explanation-of-the-neat-Sort%2BInsert-solution