Merge pull request chipbk10#103 from chipbk10/TwoPointers

Solve Problem 826 - Most Profit Assigning Work

Author: chipbk10

src/contest/ReadMe.java

@@ -14,7 +14,7 @@ public class ReadMe {
     // greedy:              1354[!]     1353[x]     1338[v]     1383[!]
     // stack:               1190[!]     975[x]      1381[v]     901[v]
     // binary search:       1351[v]     1337[v]     1292[!]     1235[!]
-    // 2 pointers:          1248[*]     1234[v]     986[v]      826
+    // 2 pointers:          1248[*]     1234[v]     986[v]      826[x]
     // sliding window:      1208[v]     1040[!]     995[!]      567
     // linked-list:         1290[v]     1019[!]     876[v]      445
     // union-find:          1202[v]     924[v]      947[!]      952

src/twopointers/Problem826_MostProfitAssigningWork.java

@@ -0,0 +1,22 @@
+package twopointers;
+
+import java.util.Arrays;
+
+public class Problem826_MostProfitAssigningWork {
+
+    public int maxProfitAssignment(int[] difficulty, int[] profit, int[] worker) {
+        int n = difficulty.length, A[][] = new int[n][2];
+        for (int i = 0; i < n; i++) A[i] = new int[] {difficulty[i], profit[i]};
+        Arrays.sort(A, (a, b) -> a[0]-b[0]);
+        Arrays.sort(worker);
+
+        int res = 0, max = 0;
+        for (int i = 0, j = 0; i < worker.length; i++) {
+            while (j < n && A[j][0] <= worker[i]) {
+                max = Math.max(max, A[j++][1]);
+            }
+            res += max;
+        }
+        return res;
+    }
+}