<p>In a warehouse, there is a row of barcodes, where the <code>i<sup>th</sup></code> barcode is <code>barcodes[i]</code>.</p>

<p>Rearrange the barcodes so that no two adjacent barcodes are equal. You may return any answer, and it is guaranteed an answer exists.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> barcodes = [1,1,1,2,2,2]
<strong>Output:</strong> [2,1,2,1,2,1]
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> barcodes = [1,1,1,1,2,2,3,3]
<strong>Output:</strong> [1,3,1,3,1,2,1,2]
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= barcodes.length &lt;= 10000</code></li>
	<li><code>1 &lt;= barcodes[i] &lt;= 10000</code></li>
</ul>

class Solution {
public:
   
    vector<int> rearrangeBarcodes(vector<int>& barcodes) {
        map<int,int>mp;
        for(int i=0;i<barcodes.size();i++){
            mp[barcodes[i]]++;
        }
        int n=barcodes.size();
        vector<int>vec(n);
        int i=0;
        vector<pair<int,int>>ans(mp.begin(),mp.end());
        sort(ans.begin(), ans.end(), [](const pair<int, int> &a, const pair<int, int> &b) {
        return a.second > b.second; 
    });
    int j=0;
        for(auto it:ans){
            int num=it.first;
            int cnt=it.second;
            
            while(cnt>0){
                if(j>=n)j=1;
                vec[j]=num;
                j+=2;
                cnt--;
                
            }
            
        }
        return vec;

    }
};
45300