Merge pull request #10 from kjs254/2-kjs254

3-kjs254
AlgoLeadMe · Feb 21, 2024 · 3ab9e6a · 3ab9e6a
2 parents 17ce3a3 + 1c2f0bf
commit 3ab9e6a
Show file tree

Hide file tree

Showing 3 changed files with 17 additions and 0 deletions.
diff --git a/kjs254/README.md b/kjs254/README.md
@@ -4,4 +4,5 @@
 |:----:|:---------:|:----:|:-----:|:----:|
 | 1차시 | 2024.02.12 |  스택  | [기능개발](https://school.programmers.co.kr/learn/courses/30/lessons/42586)  | [#2](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/2) |
 | 2차시 | 2024.02.15 | 큐 | [프로세스](https://school.programmers.co.kr/learn/courses/30/lessons/42587) | [#6](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/6) |
+| 3차시 | 2024.02.15 | 힙 | [야근 지수](https://school.programmers.co.kr/learn/courses/30/lessons/12927) | [#10](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/10) |
 ---
diff --git a/kjs254/큐/2-kjs254 → kjs254/큐/프로세스.py b/kjs254/큐/2-kjs254 → kjs254/큐/프로세스.py
diff --git a/kjs254/힙/야근 지수.py b/kjs254/힙/야근 지수.py
@@ -0,0 +1,16 @@
+import heapq
+def solution(n, works):
+    max_heap = []
+    for w in works:
+        heapq.heappush(max_heap, (-w,w))
+
+    for i in range(n):
+        max_work = heapq.heappop(max_heap)[1]-1
+        if max_work<0:
+            return 0
+
+        heapq.heappush(max_heap,(-max_work,max_work))
+
+    print(max_heap)
+    answer = sum([x[1]**2 for x in max_heap])
+    return answer