3408_Design_Task_Manager.txt

class TaskManager {
    priority_queue<pair<int, int>> tasks;
    unordered_map<int, int> taskPriority;
    unordered_map<int, int> taskOwner;
public:
    TaskManager(vector<vector<int>>& tasks) {
        for(const auto& task : tasks) { add(task[0], task[1], task[2]); }
    }
    void add(int userId, int taskId, int priority) {
        tasks.push({priority, taskId});
        taskPriority[taskId] = priority;
        taskOwner[taskId] = userId;
    }
    void edit(int taskId, int newPriority) {
        tasks.push({newPriority, taskId});
        taskPriority[taskId] = newPriority;
    }
    void rmv(int taskId) { taskPriority[taskId] = -1; }
    int execTop() {
        while(!tasks.empty()) {
            const auto task = tasks.top();
            tasks.pop();
            if(task.first == taskPriority[task.second]) {
                taskPriority[task.second] = -1;
                return taskOwner[task.second];
            }
        }
        return -1;
    }
};

/**
 * Your TaskManager object will be instantiated and called as such:
 * TaskManager* obj = new TaskManager(tasks);
 * obj->add(userId,taskId,priority);
 * obj->edit(taskId,newPriority);
 * obj->rmv(taskId);
 * int param_4 = obj->execTop();
 */