Merge pull request #138 from YoonYn9915/main

YoonYn9915 / 2월 1주차 / 3문제

Author: YoonYn9915

YoonYn9915/greedy/2025-02-08-[백준]-#1202-보석 도둑.py

@@ -0,0 +1,22 @@
+import sys
+import heapq
+
+N, K = map(int, sys.stdin.readline().split())
+jewels = []
+for _ in range(N):
+    heapq.heappush(jewels, list(map(int, sys.stdin.readline().split())))
+bags = []
+for _ in range(K):
+    bags.append(int(sys.stdin.readline()))
+bags.sort()
+
+answer = 0
+tmp_jew = []
+for bag in bags:
+    while jewels and bag >= jewels[0][0]:
+        heapq.heappush(tmp_jew, -heapq.heappop(jewels)[1])
+    if tmp_jew:
+        answer -= heapq.heappop(tmp_jew)
+    elif not jewels:
+        break
+print(answer)

YoonYn9915/greedy/2025-02-08-[백준]-#19638-센티와 마법의 뿅망치.py

@@ -0,0 +1,38 @@
+import heapq
+
+population, centi_height, limit = map(int, input().split())
+
+arr_heights = []
+max_height = -1
+
+for _ in range(population):
+    heapq.heappush(arr_heights, -(int(input())))
+
+if centi_height > -arr_heights[0]:
+    print("YES")
+    print(0)
+    exit(0)
+
+for i in range(limit):
+    # 키가 가장 큰 거인 선택
+    max_height = -(heapq.heappop(arr_heights))
+
+    # 가장 큰 거인의 키가 1인 경우 뿅망치 무효화.
+    if max_height == 1:
+        heapq.heappush(arr_heights, -(max_height))
+    else:
+        heapq.heappush(arr_heights, -(max_height//2))
+
+    max_height = -(heapq.heappop(arr_heights))
+
+    if centi_height > max_height:
+        print("YES")
+        print(i+1)
+        exit(0)
+    heapq.heappush(arr_heights, -max_height)
+
+
+print("NO")
+print(max_height)
+
+

YoonYn9915/greedy/2025-02-08-[백준]-#2217-로프.py

@@ -0,0 +1,11 @@
+n = int(input())
+rope = []
+
+for i in range(n):
+    rope.append(int(input()))
+rope.sort(reverse=True)
+
+for i in range(n):
+    rope[i] = rope[i] * (i+1)
+
+print(max(rope))