Jun 29_Queue Reconstruction by Height.cpp

class Solution {
public:
    static bool comp(vector<int>& a, vector<int>& b)
    { //Comparator function for the logic of sort
        if(a[0] == b[0]) return a[1] < b[1];
        return a[0] > b[0];
    }
    vector<vector<int>> reconstructQueue(vector<vector<int>>& people) 
    {   
        sort(people.begin(), people.end(), comp);  
        vector<vector<int>> ans;                  
        for(auto man : people)
        {
            ans.insert(ans.begin()+man[1], man);   //Inserting the element at desired position.
        }
        return ans;
    }
};