leetcode406. 根据身高重建队列

class Solution {
public:
    
    static bool cmp(const vector &v1,const vector &v2) {
        if(v1[0] == v2[0]) return v1[1] < v2[1];//当身身高一样,我们就比较k值
        return v1[0] > v2[0];
    }

    vector> reconstructQueue(vector>& people) {
        sort(people.begin(),people.end(),cmp);
        vector >ans;

        for(int i = 0; i < people.size(); i++) {
            int postion = people[i][1];//获取要插入的下标
            ans.insert(ans.begin()+postion,people[i]);
        }

        return ans;
    }   
};