leetcode_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]]

思路：贪心，对原始随机列表按高度和人数按从大到小和从小到大进行排序，然后从头到尾遍历，符合要求则作为结果

bool myfunction(pair<int, int> a, pair<int, int> b) {
    if (a.first > b.first)
    {
        return true;
    }
    else if (a.first == b.first)
    {
        if (a.second > b.second)
        {
            return false;
        }
        else if (a.second == b.second)
        {
            return false;
        }
    }
    return false;
}

class Solution {
public:
    vector<pair<int, int>> reconstructQueue(vector<pair<int, int>>& people) {
        vector<pair<int, int>> result;

        sort(people.begin(), people.end(), myfunction);
        for (int i = 0; i < people.size(); ++i)
        {
            result.insert(result.begin() + people[i].second, people[i]);
        }
        return result;
    }
};