原题链接:https://leetcode.com/problems/queue-reconstruction-by-height/
bool cmp(vector<int> a, vector<int> b) {
return a[0] > b[0] || a[0] == b[0] && a[1] < b[1];
}
class Solution {
public:
vector<vector<int>> reconstructQueue(vector<vector<int>>& people) {
sort(people.begin(), people.end(), cmp);
vector<vector<int>> res;
for (auto p : people) res.insert(res.begin() + p[1], p);
return res;
}
};