Leetcode #406: Queue Reconstruction by Height

Leetcode_0406.cpp

bool comparator(const vector<int> &x, const vector<int> &y) {
    return (x[0] > y[0]) || ((x[0] == y[0]) && (x[1] < y[1]));
}

class Solution {
public:
    vector<vector<int>> reconstructQueue(vector<vector<int>>& people) {
        vector<vector<int>> answer;
        sort(people.begin(), people.end(), comparator);
        for (auto &x:people) {
            answer.insert(answer.begin()+x[1], x);
        }
        return answer;
    }
};