<p>You are given an array <code>nums</code> consisting of non-negative integers. You are also given a <code>queries</code> array, where <code>queries[i] = [x<sub>i</sub>, m<sub>i</sub>]</code>.</p>

<p>The answer to the <code>i<sup>th</sup></code> query is the maximum bitwise <code>XOR</code> value of <code>x<sub>i</sub></code> and any element of <code>nums</code> that does not exceed <code>m<sub>i</sub></code>. In other words, the answer is <code>max(nums[j] XOR x<sub>i</sub>)</code> for all <code>j</code> such that <code>nums[j] &lt;= m<sub>i</sub></code>. If all elements in <code>nums</code> are larger than <code>m<sub>i</sub></code>, then the answer is <code>-1</code>.</p>

<p>Return <em>an integer array </em><code>answer</code><em> where </em><code>answer.length == queries.length</code><em> and </em><code>answer[i]</code><em> is the answer to the </em><code>i<sup>th</sup></code><em> query.</em></p>

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

<pre>
<strong>Input:</strong> nums = [0,1,2,3,4], queries = [[3,1],[1,3],[5,6]]
<strong>Output:</strong> [3,3,7]
<strong>Explanation:</strong>
1) 0 and 1 are the only two integers not greater than 1. 0 XOR 3 = 3 and 1 XOR 3 = 2. The larger of the two is 3.
2) 1 XOR 2 = 3.
3) 5 XOR 2 = 7.
</pre>

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

<pre>
<strong>Input:</strong> nums = [5,2,4,6,6,3], queries = [[12,4],[8,1],[6,3]]
<strong>Output:</strong> [15,-1,5]
</pre>

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

<ul>
	<li><code>1 &lt;= nums.length, queries.length &lt;= 10<sup>5</sup></code></li>
	<li><code>queries[i].length == 2</code></li>
	<li><code>0 &lt;= nums[j], x<sub>i</sub>, m<sub>i</sub> &lt;= 10<sup>9</sup></code></li>
</ul>

class TrieNode {
public:
    vector<TrieNode*> v;
    TrieNode() { v.resize(2, nullptr); }
};

class Solution {
public:
    void insert(int x, TrieNode* root) {
        TrieNode* temp = root;
        bitset<32> bs(x);
        for (int j = 31; j >= 0; j--) {
            if (!temp->v[bs[j]])
                temp->v[bs[j]] = new TrieNode();
            temp = temp->v[bs[j]];
        }
    }
    static bool comp(const pair<pair<int, int>, int>& a,
                     const pair<pair<int, int>, int>& b) {
        return a.first.second < b.first.second;
    }
    vector<int> maximizeXor(vector<int>& nums, vector<vector<int>>& queries) {
        vector<pair<pair<int, int>, int>> q;
        TrieNode* root = new TrieNode();
        int ind = 0;
        for (auto x : queries) {
            q.push_back({{x[0], x[1]}, ind});
            ind++;
        }
        sort(q.begin(), q.end(), comp);
        sort(nums.begin(), nums.end());
        int sz = q.size();
        vector<int> ans(sz, -1);
        int i = 0;
        for (auto x : q) {
            int val = x.first.first, m = x.first.second, idx = x.second;
            while (i < nums.size() && nums[i] <= m) {
                insert(nums[i], root);
                i++;
            }
            if(i==0){
                ans[idx]=-1;
                continue;
            }
            TrieNode* temp = root;
            bitset<32> bs(val);
            long long res = 0;
            for (int j = 31; j >= 0; j--) {
                if (temp->v[bs[j] ^ 1]) {
                    res += (1 << j);
                    temp = temp->v[bs[j] ^ 1];
                } else {
                    temp = temp->v[bs[j]];
                }
            }
            ans[idx] = res;
        }
        return ans;
    }
};
399231