MostProfitAssigningWork826

Author: fluency03

README.md

@@ -44,11 +44,11 @@
 | [Graph](https://github.com/fluency03/leetcode-java/blob/master/src/graph) |
 
 
-# Total: 381
+# Total: 382
 
 |   Easy  |  Medium | Hard | - |
 |:-------:|:-------:|:----:|:-:|
-|   102   |   209   |  66  | 4 |
+|   102   |   210   |  66  | 4 |
 
 
 | Question | Solution | Difficulty |
@@ -422,6 +422,7 @@
 | [777. Swap Adjacent in LR String](https://leetcode.com/problems/swap-adjacent-in-lr-string/) | [Solution](https://github.com/fluency03/leetcode-java/blob/master/src/SwapAdjacentInLRString777.java) | Medium |
 | [783. Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes/) | [Solution](https://github.com/fluency03/leetcode-java/blob/master/src/MinimumDistanceBetweenBSTNodes783.java) | Easy |
 | [819. Most Common Word](https://leetcode.com/problems/most-common-word/) | [Solution](https://github.com/fluency03/leetcode-java/blob/master/src/MostCommonWord819.java) | Easy |
+| [826. Most Profit Assigning Work](https://leetcode.com/problems/most-profit-assigning-work/) | [Solution](https://github.com/fluency03/leetcode-java/blob/master/src/MostProfitAssigningWork826.java) | Medium |
 | [841. Keys and Rooms](https://leetcode.com/problems/keys-and-rooms/) | [Solution](https://github.com/fluency03/leetcode-java/blob/master/src/KeysAndRooms841.java) | Medium |
 | [844. Backspace String Compare](https://leetcode.com/problems/backspace-string-compare/) | [Solution](https://github.com/fluency03/leetcode-java/blob/master/src/BackspaceStringCompare844.java) | Easy |
 | [845. Longest Mountain in Array](https://leetcode.com/problems/longest-mountain-in-array/) | [Solution](https://github.com/fluency03/leetcode-java/blob/master/src/LongestMountainInArray845.java) | Medium |

src/MostProfitAssigningWork826.java

@@ -0,0 +1,59 @@
+/**
+ * We have jobs: difficulty[i] is the difficulty of the ith job, and profit[i]
+ * is the profit of the ith job. 
+ * 
+ * Now we have some workers. worker[i] is the ability of the ith worker, which
+ * means that this worker can only complete a job with difficulty at most
+ * worker[i]. 
+ * 
+ * Every worker can be assigned at most one job, but one job can be completed
+ * multiple times.
+ * 
+ * For example, if 3 people attempt the same job that pays $1, then the total
+ * profit will be $3.  If a worker cannot complete any job, his profit is $0.
+ * 
+ * What is the most profit we can make?
+ * 
+ * Example 1:
+ * 
+ * Input: difficulty = [2,4,6,8,10], profit = [10,20,30,40,50], worker = [4,5,6,7]
+ * Output: 100 
+ * Explanation: Workers are assigned jobs of difficulty [4,4,6,6] and they get
+ * profit of [20,20,30,30] seperately.
+ * 
+ * Notes:
+ * 1 <= difficulty.length = profit.length <= 10000
+ * 1 <= worker.length <= 10000
+ * difficulty[i], profit[i], worker[i]  are in range [1, 10^5]
+ */
+
+public class MostProfitAssigningWork826 {
+    public int maxProfitAssignment(int[] difficulty, int[] profit, int[] worker) {
+        int N = difficulty.length;
+        Job[] jobs = new Job[N];
+        for (int i=0; i<N; i++) jobs[i] = new Job(difficulty[i], profit[i]);
+        Arrays.sort(jobs, (j1, j2) -> Integer.compare(j1.difficulty, j2.difficulty));
+        Arrays.sort(worker);
+        int res = 0;
+        int max = 0;
+        int i = 0;
+        for (int cap: worker) {
+            while (i < N && jobs[i].difficulty <= cap) {
+                max = Math.max(max, jobs[i].profit);
+                i++;
+            }
+            res += max;
+        }
+        return res;
+    }
+    
+    class Job {
+        int difficulty;
+        int profit;
+        Job (int d, int p) {
+            difficulty = d;
+            profit = p;
+        }
+    }
+
+}