406. Queue Reconstruction by Height

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.

[[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]]

比较简单，选出最小的开始排即可

    def reconstructQueue(self, people):
        """
        :type people: List[List[int]]
        :rtype: List[List[int]]
        """
        length = len(people)
        K = [[-1,-1] for i in range(length)]
        people.sort()
        for i in range(0,length):
            num = people[i][1]
            for j in range(0,length):
                if K[j] == [-1,-1] or K[j][0] >= people[i][0]:
                    num -= 1
                    if num < 0:
                        K[j] = people[i]
                        break
        return K