Merge pull request #539 from gmlrude/main

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

Author: github-actions[bot]

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

@@ -0,0 +1,49 @@
+import sys
+
+input = sys.stdin.readline
+
+n, k = map(int, input().split())
+a = list(map(int, input().split()))
+cnt = 0
+res = -1
+
+
+def merge(arr, start, mid, end):
+    global cnt, res
+    i, j = start, mid + 1
+    tmp = []
+    while i <= mid and j <= end:
+        if arr[i] <= arr[j]:
+            tmp.append(arr[i])
+            i += 1
+        else:
+            tmp.append(arr[j])
+            j += 1
+    while i <= mid:
+        tmp.append(arr[i])
+        i += 1
+    while j <= end:
+        tmp.append(arr[j])
+        j += 1
+
+    i, t = start, 0
+    while i <= end:
+        arr[i] = tmp[t]
+        cnt += 1
+        if cnt == k:
+            res = arr[i]
+            break
+        i += 1
+        t += 1
+
+
+def merge_sort(arr, start, end):
+    if start < end:
+        mid = (start + end) // 2
+        merge_sort(arr, start, mid)
+        merge_sort(arr, mid + 1, end)
+        merge(arr, start, mid, end)
+
+
+merge_sort(a, 0, n - 1)
+print(res)

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

@@ -0,0 +1,17 @@
+import sys
+
+input = sys.stdin.readline
+
+n, k = map(int, input().split())
+coin = []
+for _ in range(n):
+    coin.append(int(input()))
+
+coin = sorted(coin, reverse=True)
+res = 0
+for i in range(n):
+    if k // coin[i] > 0:
+        res += k // coin[i]
+        k %= coin[i]
+
+print(res)

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

@@ -0,0 +1,36 @@
+import re
+
+
+def solution(str1, str2):
+    answer = 0
+    str1 = str1.lower()
+    str2 = str2.lower()
+
+    str1_list = []
+    str2_list = []
+    for i in range(0, len(str1) - 1):
+        word = str1[i:i + 2]
+        if re.match("^[a-z]{2}$", word):
+            str1_list.append(word)
+
+    for i in range(0, len(str2) - 1):
+        word = str2[i:i + 2]
+        if re.match("^[a-z]{2}$", word):
+            str2_list.append(word)
+
+    # 교집합 계산
+    intersection = []
+    temp_str2_list = str2_list[:]   # (놓친부분) 초반엔 두 str 리스트 합치고 교집합 빼는 것으로 했는데 오답이었음
+    for word in str1_list:
+        if word in temp_str2_list:
+            intersection.append(word)
+            temp_str2_list.remove(word)
+
+    # 합집합 계산
+    union = str1_list[:] + temp_str2_list
+
+    if len(union) == 0:
+        return 65536
+    else:
+        similarity = len(intersection) / len(union)
+    return int(similarity * 65536)