Queue Reconstruction by Height

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