From d8d8241a346caa1fb68b73e3c1b011f447a988a0 Mon Sep 17 00:00:00 2001
From: JHLEE325 <82587652+JHLEE325@users.noreply.github.com>
Date: Sun, 3 Aug 2025 22:22:32 +0900
Subject: [PATCH] =?UTF-8?q?[20250803]=20BOJ=20/=20G5=20/=20=EA=B0=95?=
 =?UTF-8?q?=EC=9D=98=EC=8B=A4=20=EB=B0=B0=EC=A0=95=20/=20=EC=9D=B4?=
 =?UTF-8?q?=EC=A4=80=ED=9D=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...0\354\213\244 \353\260\260\354\240\225.md" | 52 +++++++++++++++++++
 1 file changed, 52 insertions(+)
 create mode 100644 "JHLEE325/202508/03 BOJ G5 \352\260\225\354\235\230\354\213\244 \353\260\260\354\240\225.md"

diff --git "a/JHLEE325/202508/03 BOJ G5 \352\260\225\354\235\230\354\213\244 \353\260\260\354\240\225.md" "b/JHLEE325/202508/03 BOJ G5 \352\260\225\354\235\230\354\213\244 \353\260\260\354\240\225.md"
new file mode 100644
index 00000000..55d974f5
--- /dev/null
+++ "b/JHLEE325/202508/03 BOJ G5 \352\260\225\354\235\230\354\213\244 \353\260\260\354\240\225.md"	
@@ -0,0 +1,52 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    static class study implements Comparable<study> {
+        int start, end;
+
+        study(int s, int e) {
+            start = s;
+            end = e;
+        }
+
+        @Override
+        public int compareTo(study o) {
+            if (this.start != o.start)
+                return Integer.compare(this.start, o.start);
+            return Integer.compare(this.end, o.end);
+        }
+    }
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st;
+        int N = Integer.parseInt(br.readLine());
+
+        study[] studies = new study[N];
+        for (int i = 0; i < N; i++) {
+            st = new StringTokenizer(br.readLine());
+            int s = Integer.parseInt(st.nextToken());
+            int e = Integer.parseInt(st.nextToken());
+            studies[i] = new study(s, e);
+        }
+
+        Arrays.sort(studies);
+
+        PriorityQueue<Integer> pq = new PriorityQueue<>();
+        pq.add(studies[0].end);
+
+        for (int i = 1; i < N; i++) {
+            int curStart = studies[i].start;
+            int curEnd = studies[i].end;
+            if (!pq.isEmpty() && pq.peek() <= curStart) {
+                pq.poll();
+            }
+            pq.add(curEnd);
+        }
+
+        System.out.println(pq.size());
+    }
+}
+```