<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)
    {
        vector<pair<int,int>> CounterNumber(10001);
        int n=barcodes.size();
        for(int i=1;i<=10000;i++)
            CounterNumber[i]={0,i};
        for(int i=0;i<n;i++)
            CounterNumber[barcodes[i]].first++;
        sort(CounterNumber.begin(),CounterNumber.end());
        reverse(CounterNumber.begin(),CounterNumber.end());
        vector<int> Result(n);
        int IndexNumber=0;
        for(int IndexString=0;IndexString<n;IndexString+=2)
        {
            if(CounterNumber[IndexNumber].first!=0)
            {
                Result[IndexString]=CounterNumber[IndexNumber].second;
                CounterNumber[IndexNumber].first--;
            }
            else
            {
                IndexNumber++;
                if(IndexNumber==10001)
                    break;
                else
                {
                    if(CounterNumber[IndexNumber].first!=0)
                    {
                        Result[IndexString]=CounterNumber[IndexNumber].second;
                        CounterNumber[IndexNumber].first--;
                    }
                    else break;
                }
            }
        }
        for(int IndexString=1;IndexString<n;IndexString+=2)
        {
            if(IndexNumber<=10000)
            {
                if(CounterNumber[IndexNumber].first!=0)
                {
                    Result[IndexString]=CounterNumber[IndexNumber].second;
                    CounterNumber[IndexNumber].first--;
                }
                else
                {
                    IndexNumber++;
                    if(IndexNumber==10001)
                        break;
                    else
                    {
                        if(CounterNumber[IndexNumber].first!=0)
                        {
                            Result[IndexString]=CounterNumber[IndexNumber].second;
                            CounterNumber[IndexNumber].first--;
                        }
                        else break;
                    }
                }
            }
            else break;
        }
        return Result;
    }
};
45200