-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathjob.c
More file actions
76 lines (64 loc) · 1.97 KB
/
job.c
File metadata and controls
76 lines (64 loc) · 1.97 KB
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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
#include <stdio.h>
void sortJobs(int n, int profit[], int deadline[], int jobId[]) {
int i, j, temp;
for (i = 0; i < n - 1; i++) {
for (j = 0; j < n - i - 1; j++) {
if (profit[j] < profit[j + 1]) {
temp = profit[j];
profit[j] = profit[j + 1];
profit[j + 1] = temp;
temp = deadline[j];
deadline[j] = deadline[j + 1];
deadline[j + 1] = temp;
temp = jobId[j];
jobId[j] = jobId[j + 1];
jobId[j + 1] = temp;
}
}
}
}
int findMaxDeadline(int n, int deadline[]) {
int max = deadline[0], i;
for (i = 1; i < n; i++) {
if (deadline[i] > max)
max = deadline[i];
}
return max;
}
void jobSequencing(int n, int profit[], int deadline[], int jobId[]) {
sortJobs(n, profit, deadline, jobId);
int maxDeadline = findMaxDeadline(n, deadline);
int schedule[maxDeadline], i, j, totalProfit = 0;
for (i = 0; i < maxDeadline; i++) {
schedule[i] = -1;
}
for (i = 0; i < n; i++) {
for (j = deadline[i] - 1; j >= 0; j--) {
if (schedule[j] == -1) {
schedule[j] = jobId[i];
totalProfit += profit[i];
break;
}
}
}
printf("\nJob Sequence: ");
for (i = 0; i < maxDeadline; i++) {
if (schedule[i] != -1)
printf("%d -> ", schedule[i]);
}
printf("\b\b \n");
printf("Max Profit = %d\n", totalProfit);
}
int main() {
int n, i;
printf("Enter the number of jobs: ");
scanf("%d", &n);
int profit[n], deadline[n], jobId[n];
printf("Enter the profit and deadline of each job:\n");
for (i = 0; i < n; i++) {
jobId[i] = i + 1;
scanf("%d %d", &profit[i], &deadline[i]);
}
jobSequencing(n, profit, deadline, jobId);
return 0;
}