Merge branch 'kcmBOJHW' of https://github.com/JavaJobJava/CodingTest into kcmBOJHW

Author: bsyzch

cmkim/BaekJoon/백준_1202.py

@@ -1,11 +1,40 @@
+import heapq
+import sys
+input = sys.stdin.readline
 n, k = map(int, input().split())
-jewel = [[0, 0] for _ in range(n)]
-bag = [0 for _ in range(k)]
+
+jewel = []
+bags = []
+
 for i in range(n):
-    jewel[i] = list(map(int, input().split()))
+    w, v = map(int, input().split())
+    heapq.heappush(jewel, (w, v))
 
 for i in range(k):
-    bag[i] = int(input())
+    heapq.heappush(bags, int(input()))
+
+result = 0
+selected = []
+for _ in range(k):
+    bags_weight = heapq.heappop(bags)
+
+    while jewel and bags_weight >= jewel[0][0]:
+        tmp = heapq.heappop(jewel)
+        w, v = tmp[0], tmp[1]
+        heapq.heappush(selected, -v)
+
+    if selected:
+        result -= heapq.heappop(selected)
 
-print(jewel)
-print(bag)
+print(result)
+'''
+4 4
+1 100
+2 200
+13 300
+10 500
+14
+3
+12
+1
+'''

cmkim/BaekJoon/백준_1541.py

@@ -0,0 +1,22 @@
+arr = input().split('-')
+num = []
+
+for i in arr:
+    if '+' in i:
+        sum = 0
+        temp = i.split('+')
+
+        for i in range(len(temp)):
+            sum += int(temp[i])
+    else:
+        sum = i
+
+    num.append(int(sum))
+
+result = num[0]
+if len(num) > 1:
+    for i in range(1,len(num)):
+
+        result -= num[i]
+
+print(result)

cmkim/BaekJoon/백준_2533.py

@@ -1,5 +1,6 @@
 import sys
 input = sys.stdin.readline
+
 sys.setrecursionlimit(10**9)
 n = int(input())
 tree = [[] for _ in range(n+1)]
@@ -12,7 +13,7 @@
     tree[a].append(b)
     tree[b].append(a)
 
-#print(tree)
+
 
 def bfs(root):
   visited[root] = True
@@ -27,4 +28,5 @@ def bfs(root):
 
 bfs(1)
 
-print(min(dp[1][0], dp[1][1]))
+print(min(dp[1][0], dp[1][1]))
+