LeetCode 406
Queue Reconstruction by Height
class Solution {
public:
static bool compare(pair<int, int> a, pair<int, int>b) {
return (a.first>b.first || (a.first==b.first&&a.second<b.second));
}
vector<pair<int, int>> reconstructQueue(vector<pair<int, int>>& people) {
vector<pair<int, int>> result;
if (people.size() == 0||people.size() == 1) return people;
sort(people.begin(), people.end(), compare);
for (int i = 0; i < people.size(); i++) {
result.insert(result.begin()+people[i].second, people[i]);
}
return result;
}
};