LeetCode-406. 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]]

题解：

一种很巧妙的解法：

先按照h降序排序，同样h的按k升序排序，然后插入到一个新的数组中。

排序：
[7, 0] 0
[7, 1] 1
[6, 1] 2
[5, 0] 3
[5, 2] 4
[4, 4] 5 
重新插入：
[7, 0]
[7, 0] [7, 1] 
[7, 0] [6, 1] [7, 1]
[5, 0] [7, 0] [6, 1] [7, 1]
[5, 0] [7, 0] 5, 2] [6, 1] [7, 1]
[5, 0] [7, 0] 5, 2] [6, 1] [4, 4] [7, 1]

class Solution {
public:
    static bool cmp(vector<int> a, vector<int> b) {
        if (a[0] != b[0]) {
            return a[0] > b[0];
        }
        return a[1] < b[1];
    }
    vector<vector<int>> reconstructQueue(vector<vector<int>>& people) {
        int n = people.size();
        sort(people.begin(), people.end(), cmp);
        vector<vector<int>> res;
        for (int i = 0; i < n; i++) {
            res.insert(res.begin() + people[i][1], people[i]);
        }
        return res;
    }
};