Queue Reconstruction by Height

 Queue Reconstruction by Height

Suppose you have a random list of people standing in a queue. Each person is described by a pair of integers (h, k), where h is the height of the person and k is the number of people in front of this person who have a height greater than or equal to h. Write an algorithm to reconstruct the queue.

Note:
The number of people is less than 1,100.

 Input:

[[7,0], [4,4], [7,1], [5,0], [6,1], [5,2]]

Output:
[[5,0], [7,0], [5,2], [6,1], [4,4], [7,1]]

class Solution {
public:
    vector<vector<int>> reconstructQueue(vector<vector<int>>& people) {
        
 
        sort(begin(people),end(people));
        int l=people.size();
        vector<vector<int>> ans(l,{INT_MAX,0});
        for(int i=0;i<l;++i){
            int cnt=0;
            for(int j=0;j<l;++j){
                if(ans[j][0]>=people[i][0] && cnt<people[i][1])
                    ++cnt;
                else if(cnt==people[i][1] && ans[j][0]==INT_MAX){
                    ans[j]=people[i];
                    break;
                }
            }
        }
        return ans;
    }
};