forked from abhinavraj23/Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathjobScheduling.cpp
More file actions
78 lines (76 loc) · 1.57 KB
/
Copy pathjobScheduling.cpp
File metadata and controls
78 lines (76 loc) · 1.57 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
77
78
#include<iostream>
#include<stdio.h>
using namespace std;
class Jobs{
int startTime;
int finishTime;
bool isScheduled = false;
public:
void setStartTime(int start){
startTime = start;
}
void setFinishTime(int finish){
finishTime = finish;
}
int getStartTime(){
return startTime;
}
void setScheduled(bool schedule){
isScheduled = schedule;
}
int getFinishTime(){
return finishTime;
}
bool checkScheduled(){
return isScheduled;
}
bool checkOVerlapping(Jobs temp){
if((startTime>= temp.getFinishTime()) || (finishTime<= temp.getStartTime())){
return false;
}else{
return true;
}
}
void printJob(){
printf("%d %d\n",startTime,finishTime);
}
};
int main(){
int numberOfJobs;
cin>>numberOfJobs;
Jobs job[numberOfJobs];
int timming[numberOfJobs][2];
for(int i=0;i<numberOfJobs;i++){
cin>>timming[i][0];
cin>>timming[i][1];
job[i].setStartTime(timming[i][0]);
job[i].setFinishTime(timming[i][1]);
}
for(int i=0;i<numberOfJobs;i++){
for(int j=0;j<numberOfJobs-1;j++){
if(job[j].getStartTime()>job[j+1].getStartTime()){
Jobs temp;
temp = job[j];
job[j] = job[j+1];
job[j+1] = temp;
}
}
}
int numberOfMachines = 0;
int jobUnscheduled = 0;
int k=0;
for(int i=0;i<numberOfJobs;i++){
if(job[i].checkScheduled() == false){
k=i;
numberOfMachines++;
for (int j=k+1;j<numberOfJobs;j++){
if((job[j].checkScheduled()==false) && (job[k].checkOVerlapping(job[j]) == false)){
job[k].setScheduled(true);
job[j].setScheduled(true);
k=j;
}
}
}
}
cout<<numberOfMachines;
}