406. Queue Reconstruction by Height

bool compare(pair<int, int> a, pair<int, int> b)
{
    if(a.first > b.first)
    return 1;
    else if(a.first == b.first && a.second < b.second)
    return 1;
    return 0;
}
class Solution {
public:
    vector<pair<int, int>> reconstructQueue(vector<pair<int, int>>& people) {
        sort(people.begin(), people.end(), compare);
        int i, n = people.size();
        vector<pair<int, int>> requeue;
        for(i = 0; i < n; i++)
        {
            requeue.insert(requeue.begin()+people[i].second, people[i]);
        }
        return requeue;
    }
};