406. Queue Reconstruction by Height

class Solution {
public:
    vector<pair<int, int>> reconstructQueue(vector<pair<int, int>>& people) {
        sort(people.begin(),people.end(),cmp);
        for(int i = 0;i < people.size();i++){
            if(people[i].second != i){
                auto p = people[i];
                people.erase(people.begin() + i);
                people.insert(people.begin() + p.second,p);
            }
        }
        return people;
    }
    static bool cmp(pair<int,int> a,pair<int,int> b){
        if(a.first > b.first || (a.first == b.first && a.second < b.second))
            return true;
        else
            return false;
    }
};