da-in
diff --git a/‎Programmers - 고득점 Kit/[정렬] K번째수/seungyeon.py
Lines changed: 17 additions & 0 deletions b/‎Programmers - 고득점 Kit/[정렬] K번째수/seungyeon.py
Lines changed: 17 additions & 0 deletions
diff --git a/‎Programmers - 고득점 Kit/[정렬] 가장 큰 수/seungyeon.py
Lines changed: 30 additions & 0 deletions b/‎Programmers - 고득점 Kit/[정렬] 가장 큰 수/seungyeon.py
Lines changed: 30 additions & 0 deletions
diff --git a/‎Programmers - 고득점 Kit/[힙] 더 맵게/seungyeon.py
Lines changed: 13 additions & 0 deletions b/‎Programmers - 고득점 Kit/[힙] 더 맵게/seungyeon.py
Lines changed: 13 additions & 0 deletions
@@ -0,0 +1,17 @@
+def main():
+    array = [1, 5, 2, 6, 3, 7, 4]
+    commands = [[2, 5, 3], [4, 4, 1], [1, 7, 3]]
+    print(solution(array,commands))
+
+
+def solution(array,commands):
+    answer = []
+    for i in range(len(commands)):
+        arr = array[commands[i][0]-1:commands[i][1]]
+        arr.sort()
+        answer.append(arr[commands[i][2]-1])
+    return answer
+
+if __name__ == "__main__":
+    main()
+        
@@ -0,0 +1,30 @@
+from itertools import permutations
+maxStr = ""
+def main():
+    # [6, 10, 2]
+    numbers=[1, 10, 100, 1000, 818, 81, 898, 89, 0, 0] 
+    solution(numbers)
+
+def solution(numbers):
+
+    per = list(permutations(numbers,len(numbers)))
+
+    rows=len(per)
+    cols=len(numbers)
+    arr = [""*cols]*rows
+
+    # 비효율. DFS는 시간초과
+    for i in range(rows):
+        for j in range(len(per[i])):
+            arr[i] += str(per[i][j])
+        arr[i] = int(arr[i])
+
+    arr = sorted(arr)
+    return str(arr[len(arr)-1])
+
+
+
+if __name__ == "__main__":
+    main()
+
+    # s = "".join(str(numbers[1]))
@@ -0,0 +1,13 @@
+import heapq
+def solution(scoville,K):
+    answer = 0
+    heapq.heapify(scoville)
+
+    while(scoville[0]<K):
+        if len(scoville) == 1 and scoville[0] < K:
+            return -1
+        new = heapq.heappop(scoville) + heapq.heappop(scoville)*2
+        heapq.heappush(scoville,new)
+        answer+=1
+    return answer
+