406. Queue Reconstruction by Height

406. Queue Reconstruction by Height
     Medium
     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]]

class Solution {
public:
    vector<vector<int>> reconstructQueue(vector<vector<int>>& people) {
        int n=people.size();
        auto cmp=[](vector<int>&a, vector<int>&b)
        {
            return a[0]>b[0]||(a[0]==b[0]&&a[1]<b[1]);//从高到矮进行排序
        };
        sort(people.begin(),people.end(),cmp);
        vector<vector<int>>ans;
        for(int i=0;i<n;i++)
            ans.insert(ans.begin()+people[i][1],people[i]);
        return ans;
    }
};