[leetcode]406. Queue Reconstruction by Height

题目链接:https://leetcode.com/problems/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.

Example

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<pair<int, int>> reconstructQueue(vector<pair<int, int>>& people)
    {
        if(people.size()==0)
            return people;
        auto cmp = [](pair<int, int> a, pair<int, int> b)
        {
            return a.second<=b.second;
        };
        sort(people.begin(),people.end(),cmp);

        for(int i=1;i<people.size();i++)
        {
            int count=0;
            int maxCount=people[i].second;
            for(int j=0;j<i;j++)
            {
                if(people[j].first>=people[i].first)
                {
                    count++;
                    if(count>maxCount)
                    {
                        auto tmp=people[i];
                        people.erase(people.begin()+i);
                        people.insert(people.begin()+j,tmp);
                        break;
                    }
                }
            }
        }

        return people;

    }
};