C++ NOTE please do this with PRIORITY QUENE. (DATA STRUCTURE AND ALGORITHMS)

Given a set of tasks with deadlines and total profit earned on completing a task find maximum profit earned by executing the task within the specified deadlines. Assume that a task takes one unit of time to execute and it can't execute data for each node includes a deadline for a task and profit earned for the task. Then arrange the list that starts with higher profit and then so beyond its deadline. Also, only a single task will be executed at a time... Arrange the task in such a way that higher profit tasks will be executed first and so on...

NOTE Data for each node includes a deadline for a task and profit earned for the task. Then arrange the list that starts with higher profit and then so on