-
Notifications
You must be signed in to change notification settings - Fork 0
/
Job Sequencing Problem
49 lines (37 loc) · 1.29 KB
/
Job Sequencing Problem
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
class Solution
{
public:
//Function to find the maximum profit and the number of jobs done.
vector<int> JobScheduling(Job arr[], int n)
{
int maxL = 0;
for(int i=0; i < n ; i++){
maxL = max(maxL , arr[i].dead);
}
priority_queue<int> deadLine[maxL + 1];
for(int i=0; i < n ; i++){
deadLine[arr[i].dead].push(arr[i].profit);
}
priority_queue<int , vector<int> , greater<int>> completed;
for(int t = 1; t <= maxL ; t++){
if(deadLine[t].size() == 0 ) continue;
priority_queue<int> tem = deadLine[t];
while(!tem.empty() && completed.size() < t){
completed.push(tem.top());
tem.pop();
}
while(!tem.empty() && tem.top() > completed.top()){
completed.pop();
completed.push(tem.top());
tem.pop();
}
}
int task_completed = completed.size();
int profit = 0;
while(completed.size()){
profit += completed.top();
completed.pop();
}
return {task_completed , profit };
}
};