<p>Given an integer array of even length <code>arr</code>, return <code>true</code><em> if it is possible to reorder </em><code>arr</code><em> such that </em><code>arr[2 * i + 1] = 2 * arr[2 * i]</code><em> for every </em><code>0 &lt;= i &lt; len(arr) / 2</code><em>, or </em><code>false</code><em> otherwise</em>.</p>

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

<pre>
<strong>Input:</strong> arr = [3,1,3,6]
<strong>Output:</strong> false
</pre>

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

<pre>
<strong>Input:</strong> arr = [2,1,2,6]
<strong>Output:</strong> false
</pre>

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

<pre>
<strong>Input:</strong> arr = [4,-2,2,-4]
<strong>Output:</strong> true
<strong>Explanation:</strong> We can take two groups, [-2,-4] and [2,4] to form [-2,-4,2,4] or [2,4,-2,-4].
</pre>

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

<ul>
	<li><code>2 &lt;= arr.length &lt;= 3 * 10<sup>4</sup></code></li>
	<li><code>arr.length</code> is even.</li>
	<li><code>-10<sup>5</sup> &lt;= arr[i] &lt;= 10<sup>5</sup></code></li>
</ul>

class Solution {
public:
    bool canReorderDoubled(vector<int>& arr) {
        std::sort(arr.begin(), arr.end(), [](int x, int y) {
            x = x > 0 ? x : -x;
            y = y > 0 ? y : -y;
            return x < y;
        });
        std::unordered_map<int, int> no_pair;
        for (int i = 0; i < arr.size(); ++i) {
            if (no_pair.size() == 0 || arr[i] % 2 != 0 || no_pair.count(arr[i] / 2) == 0) {
                ++no_pair[arr[i]];
            } else {
                --no_pair[arr[i] / 2];
                if (no_pair[arr[i] / 2] == 0) {
                    no_pair.erase(arr[i] / 2);
                }
            }
        }
        return no_pair.size() == 0;
    }
};
64200