MAYMIN 개발 스토리

n = int(input()) for _ in range(n): word = str(input()) for i in range(len(word)-1): if word[i]!=word[i+1]: if word[i] in word[i+1:]: n-=1 break print(n)

numList = [i for i in range(1,10001)] resultList = [] for i in range(1,10001): for j in str(i): i+=int(j) resultList.append(i) selfnumList = list(set(numList) - set(resultList)) selfnumList.sort() for i in selfnumList: print(i)

import sys,heapq input = sys.stdin.readline n = int(input()) heap = [] for _ in range(n): num = int(input()) heapq.heappush(heap,num) if len(heap)==1: print(0) else: result = 0 while len(heap)>1: min1 = heapq.heappop(heap) min2 = heapq.heappop(heap) result += min1 + min2 heapq.heappush(heap,min1+min2) print(result)

import sys,heapq input = sys.stdin.readline n = int(input()) heap = [] for _ in range(n): num = int(input()) if num==0: if len(heap)==0: print(0) else: min = heapq.heappop(heap)[1] print(min) else: heapq.heappush(heap,(abs(num),num))

import heapq import sys input = sys.stdin.readline n = int(input()) heap = [] for _ in range(n): num = int(input()) if num == 0: if len(heap)==0: print(0) else: min = heapq.heappop(heap) print(min) else: heapq.heappush(heap,num)

import heapq import sys # heapq는 최소힙만 지원한다. 따라서 heap에 넣을 값을 음수로 만들어줘서 최대값을 출력한다. input = sys.stdin.readline n = int(input()) heap = [] for _ in range(n): num = int(input()) if num == 0: if len(heap)==0: print(0) else: min = heapq.heappop(heap)[1] print(min) else: heapq.heappush(heap,(-num,num))