<p>You are given an array of people, <code>people</code>, which are the attributes of some people in a queue (not necessarily in order). Each <code>people[i] = [h<sub>i</sub>, k<sub>i</sub>]</code> represents the <code>i<sup>th</sup></code> person of height <code>h<sub>i</sub></code> with <strong>exactly</strong> <code>k<sub>i</sub></code> other people in front who have a height greater than or equal to <code>h<sub>i</sub></code>.</p>

<p>Reconstruct and return <em>the queue that is represented by the input array </em><code>people</code>. The returned queue should be formatted as an array <code>queue</code>, where <code>queue[j] = [h<sub>j</sub>, k<sub>j</sub>]</code> is the attributes of the <code>j<sup>th</sup></code> person in the queue (<code>queue[0]</code> is the person at the front of the queue).</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> people = [[7,0],[4,4],[7,1],[5,0],[6,1],[5,2]]
<strong>Output:</strong> [[5,0],[7,0],[5,2],[6,1],[4,4],[7,1]]
<strong>Explanation:</strong>
Person 0 has height 5 with no other people taller or the same height in front.
Person 1 has height 7 with no other people taller or the same height in front.
Person 2 has height 5 with two persons taller or the same height in front, which is person 0 and 1.
Person 3 has height 6 with one person taller or the same height in front, which is person 1.
Person 4 has height 4 with four people taller or the same height in front, which are people 0, 1, 2, and 3.
Person 5 has height 7 with one person taller or the same height in front, which is person 1.
Hence [[5,0],[7,0],[5,2],[6,1],[4,4],[7,1]] is the reconstructed queue.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> people = [[6,0],[5,0],[4,0],[3,2],[2,2],[1,4]]
<strong>Output:</strong> [[4,0],[5,0],[2,2],[3,2],[1,4],[6,0]]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= people.length &lt;= 2000</code></li>
	<li><code>0 &lt;= h<sub>i</sub> &lt;= 10<sup>6</sup></code></li>
	<li><code>0 &lt;= k<sub>i</sub> &lt; people.length</code></li>
	<li>It is guaranteed that the queue can be reconstructed.</li>
</ul>

class Solution {
public:
    static bool cond(pair<int, int> a, pair<int, int> b) {
        if (a.second != b.second) {
            return a.second < b.second;
        }
        return a.first < b.first;
    }
    vector<vector<int>> reconstructQueue(vector<vector<int>>& people) {
        vector<pair<int, int>> v;
        for (auto it : people) {
            v.push_back({it[0], it[1]});
        }
        sort(begin(v), end(v), cond);
        set<pair<int, int>> st{begin(v), end(v)};
        vector<vector<int>> ans;
        vector<int> arr;
        for (auto it : v) {
            if (it.second == 0) {
                arr.push_back(it.first);
                ans.push_back({it.first, it.second});
                st.erase({it.first, it.second});
                break;
            } else {
                break;
            }
        }
        int k=9;
        // for(auto x:st){
        //     cout<<x.first<<" "<<x.second<<endl;
        // }
        int n=people.size();
        while (st.size()) {
            for (auto it : st) {
                int num = it.first;
                int cnt = it.second;
                int lb = lower_bound(arr.begin(), arr.end(), num) - arr.begin();
                int x = arr.size() - lb;
                if (cnt == x) {
                // cout<<it.first<<" "<<it.second<<" "<<cnt<<" "<<x<<endl;;
                    ans.push_back({num,cnt});
                    arr.push_back(num);
                    sort(arr.begin(),arr.end());
                    st.erase({num,cnt});
                    break;
                }
            }
        }
        // for(auto it:ans){
        //     // cout<<it[0]<<" "<<it[1]<<endl;
        // }
        return ans;
    }
};
17600