QmVxOZ - Online C++ Compiler & Debugging Tool

#include<bits/stdc++.h>
using namespace std;

vector<int>fun(vector<int>&arr,int d){
    unordered_map<int,int>mp;
    for(int num:arr){
        mp[num]++;
    }
    priority_queue<pair<int,int>>heap;
    for(auto&[num,freq]:mp){
        heap.push({freq,num});
    }
    queue<pair<int,int>>wait;
    vector<int>ans;
    int i=0;
    while(!heap.empty()||!wait.empty()){
        if(!wait.empty()&&wait.front().first<=i){
            int num=wait.front().second;
            wait.pop();
            if(mp[num]>0){
                heap.push({mp[num],num});
            }
        }
        if(heap.empty())return{};
        auto[freq,num]=heap.top();
        heap.pop();
        ans.push_back(num);
        mp[num]--;
        if(mp[num]>0){
            wait.push({i+d,num});
        }
        i++;
    }
    return ans;
}

int main(){
    vector<int>input={1,1,1,2,2};
    int d=2;
    vector<int>output=fun(input,d);
    if(output.empty()){
        cout<<"NO";
    }else{
        cout<<"YES -> ";
        for(int num:output){
            cout<<num<<" ";
        }
        cout<<endl;
    }
    return 0;
}