[LeetCode][Python3] 406. Queue Reconstruction by Height

Problem :

https://leetcode.com/problems/queue-reconstruction-by-height/

My Solution :

class Solution:

    def reconstructQueue(self, people):

        people.sort(key=lambda x: (-x[0], x[1]))

        ans = []

        for h, k in people:

            ans.insert(k, (h, k))

        return ans