// C++ program for weighted job scheduling using Dynamic
// Programming and Binary Search
#include <bits/stdc++.h>
using namespace std;
// Indicates a job has start time, finish time and profit.
struct Job1{
int start1, finish1, profit1;
};
// Used to store subset of jobs
struct weightedJob{
// Shows vector of Jobs
vector<Job1> job1;
// Determine profit associated with included Jobs
int value1;
};
// Shows a utility function that is used for sorting events
// according to finish time
bool jobComparator(Job1 s1, Job1 s2){
return (s1.finish1 < s2.finish1);
}
// Describes a Binary Search based function to find the latest job
// (before current job) that doesn't conflict with current
// job. "index" is index of the current job. This function
// returns -1 if all jobs before index conflict with it. The
// array jobs[] is sorted in increasing order of finish time
int latestNonConflict(Job1 jobs1[], int index1){
// Used to initialize 'low' and 'high' for Binary Search
int low = 0, high = index1 - 1;
// Used to perform binary Search iteratively
while (low <= high){
int mid = (low + high) / 2;
if (jobs1[mid].finish1 <= jobs1[index1].start1){
if (jobs1[mid + 1].finish1 <= jobs1[index1].start1)
low = mid + 1;
else
return mid;
}
else
high = mid - 1;
}
return -1;
}
// Describes the main function that finds the subset of jobs
// associated with maximum profit such that no two
// jobs in the subset overlap.
int findMaxProfit(Job1 arr1[], int n1){
// Used to sort jobs according to finish time
sort(arr1, arr1 + n1, jobComparator);
// Used to create an array to store solutions of subproblems.
// DP[i] stores the Jobs involved and their total profit
// till arr[i] (including arr1[i])
weightedJob DP1[n1];
// Used to initialize DP1[0] to arr1[0]
DP1[0].value1 = arr1[0].profit1;
DP1[0].job1.push_back(arr1[0]);
// Used to fill entries in DP1[] using recursive property
for (int i = 1; i < n1; i++){
// Determine profit including the current job
int inclProf1 = arr1[i].profit1;
int l1 = latestNonConflict(arr1, i);
if (l1 != - 1)
inclProf1 += DP1[l1].value1;
// Used to store maximum of including and excluding
if (inclProf1 > DP1[i - 1].value1){
DP1[i].value1 = inclProf1;
// includes previous jobs and current job
DP1[i].job1 = DP1[l1].job1;
DP1[i].job1.push_back(arr1[i]);
}
else
// excludes the current job
DP1[i] = DP1[i - 1];
}
// DP1[n - 1] stores the result
cout << "Optimal Jobs for maximum profits are\n" ;
for (int i=0; i<DP1[n1-1].job1.size(); i++){
Job1 j = DP1[n1-1].job1[i];
cout << "(" << j.start1 << ", " << j.finish1
<< ", " << j.profit1 << ")" << endl;
}
cout << "\nTotal Optimal profit is " << DP1[n1 - 1].value1;
}
// Driver program
int main(){
Job1 arr1[] = {{4, 6, 25}, {2, 3, 55}, {7, 20, 150},
{3, 150, 250} };
int n1 = sizeof(arr1)/sizeof(arr1[0]);
findMaxProfit(arr1, n1);
return 0;
}
About Online C++ Compiler
Try our Online C++ Compiler (Version GNU GCC v11.3.0) to Edit, Run, and Share your C++ Code directly from your browser. This online development environment provides you the latest version GNU GCC v11.3.0.
How to use Online C++ Compiler?
Write and Execute Code
- Write your program (or, paste it) directly under the "Source Code" tab.
- If you want to save your program, go to the "Project" menu and save it.
- You can directly execute your program without saving it by clicking on on "Execute" button.
User Input
The latest version of Coding Ground allows to provide program input at run time from the termnial window exactly the same way as you run your program at your own computer. So simply run a program and provide your program input (if any) from the terminal window available in the right side.
Online C++ Compiler: Keyboard Shortcuts
The following are the keyword shortcut of this Online C++ Compiler:
Shortcut | Description |
⌘ + Enter | Run the program |
⌘ + S | Save Project (Login Required) |
⇧ + ⌘ + S | Save As Project |
⌘ + P | New Project |
⌘ + G | Share Project |
⌘ + Z | Undo Editing |
⌘ + Y | Redo Editing |
⌘ + A | Select All Text |
⌘ + X | Cut Selected Text |
⌘ + C | Copy Selected Text |
⌘ + V | Paste Copied Text |
⌘ + F | Search Text |
⌘ + ⌥ + F | Replace Text |
Shortcut | Description |
Ctrl + Enter | Run the program |
Ctrl + S | Save Project |
Shift + Ctrl + S | Save As Project |
Ctrl + G | Share Project |
Ctrl + Z | Undo Editing |
Ctrl + Y | Redo Editing |
Ctrl + A | Select All Text |
Ctrl + X | Cut Selected Text |
Ctrl + C | Copy Selected Text |
Ctrl + V | Paste Copied Text |
Ctrl + F | Search Text |
Ctrl + H | Replace Text |
Online C++ Compiler: Save and Share C++ Code (Project)
Save C++ Project Online
You can save your C++ Project with us so that you can access this project later on. To save a project you will need to create a login Id with us. So before you save a project, please create a login Id using a link given at the top right corner of this page.
Share C++ Project Online
You can use this feature to share your C++ Code with your teachers, classmates and colleagues. Just click Share Button and it will create a short link, which can be shared through Email, WhatsApp or even through Social Media. A shared link will be deleted if it has been passive for almost 3 months.
More Features of Online C++ Compiler
- Theme – You can change the current editor's theme from the "Editor Theme" option under "Settings" menu.
- Font Size – You can change the font size of the editor /compiler from from the "Font Size" option under "Settings" menu.
- Tab Size – You can change the tab size from the "Tab Size" option under "Settings" Menu.
- Show/Hide Line Numbers – You can show/hide the line number with the code from the "Show Line Numbers" or "Hide Line Numbers" option under "Settings" Menu.
- And, many more.
Benefits of Using Online C++ Compiler
There are several benefits of using the Online C++ Compiler to run your C++ code:
- Platform independence: You can run your code from any device without taking care of operating systems.
- Convenience: You don't need to install anything for using this.
- No setup required: There is no need for additional setup to run your code.
- Updated version: Our online compiler/editors/terminals are the latest up-to-date.