LeetCode_406. Queue Reconstruction by Height

題目描述：

bool cmp(vector<int> it1,vector<int> it2){
    if(it1[0]!=it2[0])
        return it1[0]>it2[0];//将身高高的排在前面
    return it1[1]<it2[1];//将編号小的排在前面(保證每次插入偏置的時候都是有效位置)
}

class Solution {
public:
    vector<vector<int>> reconstructQueue(vector<vector<int>>& people) {
        if(people.empty())
            return res;
        sort(people.begin(),people.end(),cmp);
        for(int i=0;i<people.size();i++){
            res.insert(res.begin()+people[i][1],people[i]);
        }
        return res;
    }
private:
    vector<vector<int>> res;
};