Merge pull request #624 from Yujin-Baek/main

[백유진] 91차 라이브 코테 제출

Author: github-actions[bot]

live9/test91/문제1/백유진.py

@@ -0,0 +1,31 @@
+n = int(input())
+arr = list(map(int, input().split()))
+
+arr.sort()
+
+start = 0
+end = n-1
+
+min = float("inf")
+answer = []
+
+while start < end:
+  cum = arr[start] + arr[end]
+  if cum == 0:
+    answer.append([arr[start], arr[end]])
+    break
+  elif cum < 0:
+    if abs(cum) < min:
+      min = abs(cum)
+      answer.append([arr[start], arr[end]])
+    start += 1
+  else:
+    if abs(cum) < min:
+      min = abs(cum)
+      answer.append([arr[start], arr[end]])
+    end -= 1
+
+result = answer.pop()
+result.sort()
+print(*result)
+

live9/test91/문제2/백유진.py

@@ -0,0 +1,15 @@
+from itertools import permutations
+
+n = int(input())
+arr = list(map(int, input().split()))
+
+max = 0
+
+for per in permutations(arr):
+  cum = 0
+  for i in range(n-1):
+    cum += abs(per[i] - per[i+1])
+  if cum > max:
+    max = cum
+
+print(max)

live9/test91/문제3/백유진.py

@@ -0,0 +1,30 @@
+def solution(answers):
+    answer = []
+    
+    arr1 = [1, 2, 3, 4, 5]
+    arr2 = [2, 1, 2, 3, 2, 4, 2, 5]
+    arr3 = [3, 3, 1, 1, 2, 2, 4, 4, 5, 5]
+    
+    result1 = 0
+    result2 = 0
+    result3 = 0
+    
+    for idx, ans in enumerate(answers):
+        print(ans)
+        if ans == arr1[idx%5]:
+            result1 += 1
+        if ans == arr2[idx%8]:
+            result2 += 1
+        if ans == arr3[idx%10]:
+            result3 += 1
+            
+    max_score = max(result1, result2, result3)
+    
+    if result1 == max_score:
+        answer.append(1)
+    if result2 == max_score:
+        answer.append(2)
+    if result3 == max_score:
+        answer.append(3)
+    
+    return answer