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]]
Subscribe to see which companies asked this question.
class Solution {
public:
vector<pair<int, int>> reconstructQueue(vector<pair<int, int>>& people) {
if(people.size()==0) return {};
auto cmp = [](pair<int, int> a, pair<int, int> b)
{ return a.first==b.first?a.second<b.second:a.first>b.first; };
sort(people.begin(), people.end(), cmp);
vector<pair<int, int>> ans;
for(auto val: people)
ans.insert(ans.begin() + val.second, val);
return ans;
}
};