Queue Reconstruction by height

Author: gs146

Queue Reconstruction by height

@@ -0,0 +1,19 @@
+class Solution {
+public:
+    static bool cmp(vector<int> a, vector<int> b)
+    {
+        if(a[0] == b[0]) return (a[1]>b[1]);
+        return (a[0]<b[0]);
+    }
+    vector<vector<int>> reconstructQueue(vector<vector<int>>& people) 
+    {
+        vector<vector<int>> res;
+        
+        sort(people.begin(), people.end(), cmp);
+        for(int i = people.size()-1; i>=0; i--)
+        {
+            res.insert(res.begin()+people[i][1], people[i]);
+        }
+        return res;
+    }
+};