Job sequencing algorithm in C++

Author: AMITAERO7

C++/job_sequencing.cpp

@@ -0,0 +1,63 @@
+#include<iostream> 
+#include<algorithm> 
+using namespace std; 
+  
+
+struct Job 
+{ 
+   char id;      
+   int dead;    
+   int profit;  
+}; 
+  
+ 
+bool comparison(Job a, Job b) 
+{ 
+     return (a.profit > b.profit); 
+} 
+  
+
+void printJobScheduling(Job arr[], int n) 
+{ 
+  
+    sort(arr, arr+n, comparison); 
+  
+    int result[n]; 
+    bool slot[n];  
+  
+    
+    for (int i=0; i<n; i++) 
+        slot[i] = false; 
+  
+    
+    for (int i=0; i<n; i++) 
+    { 
+      
+       for (int j=min(n, arr[i].dead)-1; j>=0; j--) 
+       { 
+          
+          if (slot[j]==false) 
+          { 
+             result[j] = i;  
+             slot[j] = true; 
+             break; 
+          } 
+       } 
+    } 
+  
+   
+    for (int i=0; i<n; i++) 
+       if (slot[i]) 
+         cout << arr[result[i]].id << " "; 
+} 
+  
+
+int main() 
+{ 
+    Job arr[] = { {'a', 2, 100}, {'b', 1, 19}, {'c', 2, 27}, 
+                   {'d', 1, 25}, {'e', 3, 15}}; 
+    int n = sizeof(arr)/sizeof(arr[0]); 
+    cout << "Following is maximum profit sequence of jobsn"; 
+    printJobScheduling(arr, n); 
+    return 0; 
+}