codeforces D. Merge Equals

看了题解，做法很强，一直纠结在一定要先弄最小的前两个数合并，第一感觉是优先队列，但我写的超时，无语了，这个做法真的很强

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<map>
using namespace std;
typedef long long LL;
const int N = 150005;
LL a[N];
map<LL,int>mp;
int main()
{
    LL n;
    scanf("%lld",&n);
    LL sum = n;
    for(int i = 1;i <= n;++i)
    {
        scanf("%lld",&a[i]);
        while(mp[a[i]])
        {
            a[mp[a[i]]] = 0;
            mp[a[i]] = 0;
            a[i]*=2;
            sum--;
        }
        mp[a[i]] = i;
    }
    printf("%lld\n",sum);
    bool flag = false;
    for(int i = 1;i <= n;++i)
    {
        if(a[i] != 0){
           if(!flag){
               printf("%lld",a[i]);
               flag = true;
           }
           else{
               printf(" %lld",a[i]);
           }
        }
    }
    printf("\n");
    return 0;
}