baekjoon. 1083 소트 [Gold V][python] https://www.acmicpc.net/problem/1083 N = int(input()) numList = list(map(int, input().split())) S = int(input()) swipe = 0 while (swipe S: break if numList[i] > possibleMax: possibleMax = numLi.. 🤖 알고리즘 2023.06.15