takeU

n, k = map(int, input().split()) li = list(map(int, input().split())) count = 0 for i in range(n - 1, 0, -1): idx = li.index(max(li[:i + 1])) if idx != i: li[idx], li[i] = li[i], li[idx] count += 1 if count == k: print(li[idx], li[i]) exit() print(-1) 선택정렬

from collections import deque import sys input = sys.stdin.readline n, m, r = map(int, input().split()) graph = [[] for _ in range(n + 1)] visited = [0] * (n + 1) count = 1 for _ in range(m): a, b = map(int, input().split()) graph[a].append(b) graph[b].append(a) def bfs(v): global count q = deque([r]) visited[r] = 1 while q: v = q.popleft() graph[v].sort(reverse=True) for g in graph[v]: if visit..

from collections import deque import sys input = sys.stdin.readline n, m, r = map(int, input().split()) graph = [[] for _ in range(n + 1)] visited = [0] * (n + 1) count = 1 for _ in range(m): a, b = map(int, input().split()) graph[a].append(b) graph[b].append(a) def bfs(v): global count q = deque([r]) visited[r] = 1 while q: v = q.popleft() graph[v].sort() for g in graph[v]: if visited[g] == 0: ..

import sys sys.setrecursionlimit(10 ** 8) input = sys.stdin.readline n, m, r = map(int, input().split()) graph = [[] for _ in range(n + 1)] visited = [0] * (n + 1) ans = [0] * (n + 1) count = 1 for _ in range(m): x, y = map(int, input().split()) graph[x].append(y) graph[y].append(x) def dfs(node): global count visited[node] = 1 ans[node] = count graph[node].sort(reverse=True) for g in graph[node..

import sys sys.setrecursionlimit(10**9) input = sys.stdin.readline n, m, r = map(int, input().split()) graph = [[] for _ in range(n + 1)] visited = [0] * (n + 1) count = 1 for _ in range(m): a, b = map(int, input().split()) graph[a].append(b) graph[b].append(a) def dfs(v): global count visited[v] = count graph[v].sort() for g in graph[v]: if visited[g] == 0: count += 1 dfs(g) dfs(r) for i in ran..

import sys input = sys.stdin.readline s = list(input()) n = int(input()) acc = [] li = [0] * 26 for c in s: if 97

from itertools import combinations from math import gcd n = int(input()) li = sorted([int(input()) for _ in range(n)]) ans = [] g = li[1] - li[0] for i in range(n - 1): g = gcd(g, li[i + 1] - li[i]) for j in range(2, int(g ** 0.5) + 1): if g % j == 0: ans.append(j) ans.append(g // j) ans.append(g) ans = sorted(list(set(ans))) print(*ans) gcd

l = int(input()) li = sorted(list(map(int, input().split())) + [0]) t = int(input()) ans = 0 for i in range(len(li) - 1): if li[i] == t or li[i + 1] == t: ans = 0 break elif li[i] < t < li[i + 1]: ans = (t - li[i]) * (li[i + 1] - t) - 1 break print(ans)

while True: graph = list(map(int, input().split())) + [0] n, graph = graph[0], graph[1:] if n == 0: break left, ans = 0, 0 stack = [(0, graph[0])] for right in range(1, len(graph)): left = right while stack and stack[-1][1] > graph[right]: left, height = stack.pop() ans = max(ans, height * (right - left)) stack.append((left, graph[right])) print(ans) 스택

while True: s = input().split() if s == ['#']: break li = list(map(lambda x: x[0] if len(x) == 1 else x[0] + x[1:-1][::-1] + x[-1], s)) print(' '.join(li))