Time: 258 ms (72.24%), Space: 46.2 MB (97.84%) - LeetHub

Author: subhamengine

1235-maximum-profit-in-job-scheduling/1235-maximum-profit-in-job-scheduling.cpp

@@ -0,0 +1,41 @@
+struct Job {
+    int start, end, profit;
+};
+
+class Solution {
+public:
+    int jobScheduling(vector<int>& startTime, vector<int>& endTime, vector<int>& profit) {
+        int n = (int)startTime.size();
+        
+        Job arr[n];
+        for(int i = 0; i < n; i++) {
+            arr[i].start = startTime[i];
+            arr[i].end = endTime[i];
+            arr[i].profit = profit[i];
+        }
+        sort(arr, arr + n, [&](auto &j1, auto &j2){
+            if(j1.end == j2.end) 
+                return j1.profit > j2.profit;
+            return j1.end < j2.end;
+        });
+
+        vector<int> dp(n+1, 0);                      // dp[i] = maximum profit earned till jobs(1...i)
+        dp[1] = arr[0].profit;
+
+        for(int i = 2; i <= n; i++) {
+            int l = 0, r = i - 2, j = 0;
+
+            while(l <= r) {
+                int mid = l + (r - l) / 2;
+
+                if(arr[mid].end <= arr[i - 1].start) {
+                    j = mid + 1;
+                    l = mid + 1;
+                }
+                else { r = mid - 1; }
+            }
+            dp[i] = max(dp[i - 1], arr[i - 1].profit + dp[j]);
+        }
+        return dp[n];
+    }
+};