Description

Submission

class Solution {
public:
    vector<int> busiestServers(int k, vector<int>& arrival, vector<int>& load) {
        set<int> free;
        priority_queue<pair<int,int>, vector<pair<int, int>>, greater<pair<int,int>>> busy;

        for(int i = 0; i < k; ++i) {
            free.insert(i);
        }

        vector<int> count(k, 0);

        for(int i = 0; i < arrival.size(); ++i) {
            while(!busy.empty() && busy.top().first <= arrival[i]) {
                free.insert(busy.top().second);
                busy.pop();
            }
            if(free.empty()) continue;

            auto iter = free.lower_bound(i%k);
            if(iter == free.end()) iter = free.begin();

            int id = *iter;
            busy.push({load[i] + arrival[i], id});
            free.erase(id);
            count[id]++;
        }

        vector<int> ret;
        int maxCount =* max_element(count.begin(), count.end());
        for(int i = 0; i < k; ++i) {
            if(count[i] == maxCount) ret.push_back(i);
        }
        return ret;
    }
};