package leetcode;

/**
 * https://leetcode.com/problems/most-profit-assigning-work/
 */
public class Problem826 {
    public int maxProfitAssignment(int[] difficulty, int[] profit, int[] worker) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Problem826 prob = new Problem826();
    }
}

@@ -320,16 +320,170 @@
 m826();%0A
+        System.out.println(prob.maxProfitAssignment(new int%5B%5D%7B2, 4, 6, 8, 10%7D,%0A            new int%5B%5D%7B10, 20, 30, 40, 50%7D, new int%5B%5D%7B4, 5, 6, 7%7D)); // 100%0A
     %7D%0A%7D%0A

Update problem 826