<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) {
        map<int,int>mp;
        for(auto x:arr){
            mp[x]++;
        }
        for(auto x:mp){
            if(mp.find(2*(x.first))!=mp.end() && mp[2*(x.first)]>0 && mp[x.first]>0){
                cout<<x.first<<" "<<2*x.first<<endl;
                int p = min(mp[x.first],mp[2*(x.first)]);
                mp[x.first] -= p;
                mp[2*(x.first)] -= p;
            }
            else if(x.first%2==0 && mp.find((x.first)/2)!=mp.end() && mp[(x.first)/2]>0 && mp[x.first]>0){
                cout<<x.first<<" "<<x.first/2<<endl;
                int p = min(mp[x.first],mp[(x.first)/2]);
                mp[x.first] -= p;
                mp[(x.first)/2] -= p;
            }
        }
        for(auto x:mp){
            if(x.second>0){
                // cout<<x.first<<endl;
                return false;
            }
        }
        return true;
    }
};
60900