Queue Reconstruction by Height

[leetcode]Queue Reconstruction by Height

链接：https://leetcode.com/problems/queue-reconstruction-by-height/description/

Question

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

Solution

class Solution {
public:
  struct compare {
    bool operator()(const pair<int, int>& left, const pair<int, int>& right) {
      return left.first > right.first || (left.first == right.first && left.second < right.second);
    }
  };

  vector<pair<int, int>> reconstructQueue(vector<pair<int, int>>& people) {
    // 按照first从大到小排序，相同的按second按从小到大排序
    sort(people.begin(), people.end(), compare());
    vector<pair<int, int>> res;
    for (int i = 0; i < people.size(); i++)
      // 因为数组按照降序排序，所以每次只需要将元素插入到新数组的k的位置即可
      res.insert(res.begin() + people[i].second, people[i]);
    return res;
  }
};

思路：将people按照高度从高到低排序，高度相同的，人数少的在前。也就是说挑选的时候有一个偏向，先挑高的。从高到低排序的目的就是为了当为一个元素选择位置时，只需考虑前面的元素就可以了，不需要考虑没有选择的元素部分。比如{[7,0][7, 1]}之后是[6, 1]，[6, 1]只需考虑前面的元素中我应该放在哪就可以了。