Merge pull request #525 from gmlrude/main

[박희경] 64차 라이브 코테 제출

Author: eric-hjh

live6/test64/문제1/박희경.py

@@ -0,0 +1,17 @@
+import sys
+from itertools import *
+
+input = sys.stdin.readline
+
+n = sorted(list(map(str, input().rstrip())), reverse=True)
+sum = 0
+
+if '0' not in n:
+    print(-1)
+else:
+    for i in n:
+        sum += int(i)
+    if sum % 3  == 0:
+        print(''.join(n))
+    else:
+        print(-1)

live6/test64/문제2/박희경.py

@@ -0,0 +1,31 @@
+import sys
+
+input = sys.stdin.readline
+
+n, k = map(int, input().split())
+g = []
+x = []
+
+for _ in range(n):
+    a, b = map(int, input().split())
+    g.append(a)
+    x.append(b)
+
+
+bucket = [0] * (max(x) + 1)
+for i in range(n):
+    bucket[x[i]] = g[i]
+
+# [0, 5, 2, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 10]
+start, end = 0, k*2+1
+ice = max_ice = sum(bucket[start:end+1])
+
+while end < len(bucket) - 1:
+    end += 1
+    ice += bucket[end]
+    ice -= bucket[start]
+    start += 1
+
+    max_ice = max(max_ice, ice)
+
+print(max_ice)

live6/test64/문제3/박희경.py

@@ -0,0 +1,21 @@
+from collections import deque
+
+
+def solution(cacheSize, cities):
+    ans = 0
+    if cacheSize == 0:
+        return len(cities) * 5
+
+    cache = deque(maxlen=cacheSize)
+
+    for city in cities:
+        city = city.lower()
+        if city in cache:
+            ans += 1
+            cache.remove(city)  # (놓친 부분) LRU 이기 때문에 새로 다시 캐싱
+            cache.append(city)
+        else:
+            ans += 5
+            cache.append(city)
+
+    return ans