From 60e5f97d989f5f0dd4337934314608e26750baf9 Mon Sep 17 00:00:00 2001
From: jclee0109 <jclee0109@gist.ac.kr>
Date: Mon, 16 Jan 2023 01:20:36 +0900
Subject: [PATCH 1/2] Soup/Bread: CLEAR!

---
 Sort_Restaurant1/juchan/2750.py | 31 +++++++++++++++++++++++++++++++
 Sort_Restaurant1/juchan/2752.py |  8 ++++++++
 2 files changed, 39 insertions(+)
 create mode 100644 Sort_Restaurant1/juchan/2750.py
 create mode 100644 Sort_Restaurant1/juchan/2752.py

diff --git a/Sort_Restaurant1/juchan/2750.py b/Sort_Restaurant1/juchan/2750.py
new file mode 100644
index 0000000..b9ce8a4
--- /dev/null
+++ b/Sort_Restaurant1/juchan/2750.py
@@ -0,0 +1,31 @@
+import sys
+
+input = sys.stdin.readline
+
+n = int(input())
+# nums = []
+# for _ in range(n):
+#     num = int(input())
+#     nums.append(num)
+    
+# nums.sort()
+# for i in range(n):
+#     print(nums[i])
+
+# list sort 메소드는 O(nlogn)의 시간복잡도를 가진다.
+# 백준기준 메모리 114327KB, 시간 124ms
+
+from heapq import heappush, heappop
+
+heap = []
+
+for _ in range(n):
+    num = int(input())
+    heappush(heap, num)
+
+for i in range(n):
+    print(heappop(heap))
+    
+# heapq 모듈을 사용하면 O(nlogn)의 시간복잡도를 가진다.
+# 백준기준 메모리 115268KB, 시간 140ms
+
diff --git a/Sort_Restaurant1/juchan/2752.py b/Sort_Restaurant1/juchan/2752.py
new file mode 100644
index 0000000..2a02a85
--- /dev/null
+++ b/Sort_Restaurant1/juchan/2752.py
@@ -0,0 +1,8 @@
+import sys
+
+input = sys.stdin.readline
+
+nums = list(map(int, input().split()))
+
+nums.sort()
+print(*nums) # *을 붙이면 리스트의 요소들을 하나씩 출력
\ No newline at end of file

From a9d64972f7fa3d758aacb4e81196e939ff70b24a Mon Sep 17 00:00:00 2001
From: jclee0109 <jclee0109@gist.ac.kr>
Date: Mon, 16 Jan 2023 01:40:33 +0900
Subject: [PATCH 2/2] Salad: Yummy

---
 Sort_Restaurant1/juchan/11004.py | 27 +++++++++++++++++++++++++++
 Sort_Restaurant1/juchan/2751.py  | 30 ++++++++++++++++++++++++++++++
 2 files changed, 57 insertions(+)
 create mode 100644 Sort_Restaurant1/juchan/11004.py
 create mode 100644 Sort_Restaurant1/juchan/2751.py

diff --git a/Sort_Restaurant1/juchan/11004.py b/Sort_Restaurant1/juchan/11004.py
new file mode 100644
index 0000000..d659628
--- /dev/null
+++ b/Sort_Restaurant1/juchan/11004.py
@@ -0,0 +1,27 @@
+import sys
+
+input = sys.stdin.readline
+
+N, K = map(int, input().split())
+nums = list(map(int, input().split()))
+
+nums.sort()
+print(nums[K-1])
+# list sort 메소드는 O(nlogn)의 시간복잡도를 가진다.
+# 백준기준 메모리 646904KB, 시간 2828ms
+
+# from heapq import heappush, heappop
+
+# heap = []
+
+# for num in nums:
+#     heappush(heap, num)
+
+# ans = 0
+# for i in range(K):
+#     ans = heappop(heap)
+
+# print(ans)
+# heapq 모듈을 사용하면 O(nlogn)의 시간복잡도를 가진다.
+# 백준기준 메모리 696680KB, 시간 4016ms
+
diff --git a/Sort_Restaurant1/juchan/2751.py b/Sort_Restaurant1/juchan/2751.py
new file mode 100644
index 0000000..3d339f9
--- /dev/null
+++ b/Sort_Restaurant1/juchan/2751.py
@@ -0,0 +1,30 @@
+import sys
+
+input = sys.stdin.readline
+
+n = int(input())
+nums = []
+for _ in range(n):
+    num = int(input())
+    nums.append(num)
+
+nums.sort()
+for i in range(n):
+    print(nums[i])
+
+# list sort 메소드는 O(nlogn)의 시간복잡도를 가진다.
+# 백준기준 메모리 114327KB, 시간 124ms
+
+# from heapq import heappush, heappop
+
+# heap = []
+
+# for _ in range(n):
+#    num = int(input())
+#    heappush(heap, num)
+
+# for i in range(n):
+#    print(heappop(heap))
+    
+# heapq 모듈을 사용하면 O(nlogn)의 시간복잡도를 가진다.
+# 백준기준 메모리 115268KB, 시간 140ms
\ No newline at end of file