-
Notifications
You must be signed in to change notification settings - Fork 0
/
406.hpp
53 lines (40 loc) · 1.21 KB
/
406.hpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
//
// Created by bai on 17-6-30.
//
#ifndef LEETCODE_406_HPP
#define LEETCODE_406_HPP
#include <iostream>
#include <queue>
#include <algorithm>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <numeric>
using namespace std;
/**
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) {
sort(people.begin(), people.end(), [](const pair<int, int> &lhs, const pair<int, int> &rhs) -> bool {
return lhs.first > rhs.first || (lhs.first == rhs.first && lhs.second < rhs.second);
});
vector<pair<int, int >> res;
for (auto &p:people) {
res.insert(res.begin() + p.second, p);
}
return res;
}
};
#endif //LEETCODE_406_HPP