Merge pull request chipbk10#99 from chipbk10/Heap

Solve Problem 1383 - Maximum Performance of a team

Author: chipbk10

TipsAndTricks.md

@@ -17,4 +17,5 @@ Store currently unsolved elements, later if there is a bigger number, withdraw t
 - initiate UF when doing union (using Map) [947](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column/discuss/197668/Count-the-Number-of-Islands-O(N)
 - how to guess an element from a set? [843](https://leetcode.com/problems/guess-the-word/discuss/160945/Python-O(n)-with-maximum-overlap-heuristic)
 - circular array. Avoid the circular point by working on 2 intervals `[0..n-1)` && `[1..n)` [213](), [1388]()
+- using XOR (identical = 0, different = 1) to check duplicated elements in array [136]()
 

src/contest/ReadMe.java

@@ -8,10 +8,10 @@ public class ReadMe {
     // graph:               997[v]      1361[v]     1043[v]     1387[~]
     // dfs:                 1319[v]     1254[v]     1377[v]     1145[x]
     // bfs:                 1345[v]     1368[!]     1311[v]     1293[x]
-    // backtrack:           1307[!]     1239[v]     1219[v]     1291
-    // dp:                  1349[!]     1340[v]     1367[v]     1388
-    // divide & conquer:    932[!]      514         903[v]      327
-    // greedy:              1354[!]     1353[x]     1338[v]     1383
+    // backtrack:           1307[!]     1239[v]     1219[v]     1291[~]
+    // dp:                  1349[!]     1340[v]     1367[v]     1388[!]
+    // divide & conquer:    932[!]      514         903[v]      327[x]
+    // greedy:              1354[!]     1353[x]     1338[v]     1383[!]
     // stack:               1190[!]     975[x]      1381[v]     901
     // binary search:       1351[v]     1337[v]     1292[!]     1235
     // 2 pointers:          1248[*]     1234[v]     986[v]      826

src/heap/Problem1383_MaximumPerformanceOfTeam.java

@@ -0,0 +1,28 @@
+package heap;
+
+import java.util.PriorityQueue;
+
+public class Problem1383_MaximumPerformanceOfTeam {
+
+    public int maxPerformance(int n, int[] speed, int[] efficiency, int k) {
+        // sum(speed) * min(efficiency)
+        // k engineers
+
+        PriorityQueue<Integer> effQueue = new PriorityQueue<>((i,j) -> efficiency[j] - efficiency[i]);
+        for (int i = 0; i < n; i++) effQueue.offer(i);
+
+        long sum = 0, res = 0;
+        PriorityQueue<Integer> spQueue = new PriorityQueue<>();
+        while (!effQueue.isEmpty()) {
+            int i = effQueue.poll();
+            spQueue.offer(speed[i]);
+            sum += speed[i];
+            if (spQueue.size() > k) {
+                sum -= spQueue.poll();
+            }
+            res = Math.max(res, sum * efficiency[i]);
+        }
+        return (int) (res % (long)(1e9 + 7));
+    }
+
+}