From 5cd50a869c89578cb059117417834c56ee60bdad Mon Sep 17 00:00:00 2001
From: Ukj0ng <90972240+Ukj0ng@users.noreply.github.com>
Date: Fri, 31 Oct 2025 23:04:17 +0900
Subject: [PATCH] =?UTF-8?q?[20251031]=20BOJ=20/=20G5=20/=20=ED=9D=99?=
 =?UTF-8?q?=EA=B8=B8=20=EB=B3=B4=EC=88=98=ED=95=98=EA=B8=B0=20/=20?=
 =?UTF-8?q?=ED=95=9C=EC=A2=85=EC=9A=B1?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...64\354\210\230\355\225\230\352\270\260.md" | 53 +++++++++++++++++++
 1 file changed, 53 insertions(+)
 create mode 100644 "Ukj0ng/202510/31 BOJ G5 \355\235\231\352\270\270 \353\263\264\354\210\230\355\225\230\352\270\260.md"

diff --git "a/Ukj0ng/202510/31 BOJ G5 \355\235\231\352\270\270 \353\263\264\354\210\230\355\225\230\352\270\260.md" "b/Ukj0ng/202510/31 BOJ G5 \355\235\231\352\270\270 \353\263\264\354\210\230\355\225\230\352\270\260.md"
new file mode 100644
index 00000000..336130ab
--- /dev/null
+++ "b/Ukj0ng/202510/31 BOJ G5 \355\235\231\352\270\270 \353\263\264\354\210\230\355\225\230\352\270\260.md"	
@@ -0,0 +1,53 @@
+```
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    private static final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+    private static final BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+    private static List<int[]> events;
+    private static int N, L, answer;
+
+    public static void main(String[] args) throws IOException {
+        init();
+
+        bw.write(answer + "\n");
+        bw.flush();
+        bw.close();
+        br.close();
+    }
+
+    private static void init() throws IOException {
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        N = Integer.parseInt(st.nextToken());
+        L = Integer.parseInt(st.nextToken());
+        answer = 0;
+        int covered = -1;
+
+        events = new ArrayList<>();
+
+        for (int i = 0; i < N; i++) {
+            st = new StringTokenizer(br.readLine());
+            int start = Integer.parseInt(st.nextToken());
+            int end = Integer.parseInt(st.nextToken());
+
+            events.add(new int[]{start, end});
+        }
+
+        events.sort((o1, o2) -> Integer.compare(o1[1], o2[1]));
+
+        for (int[] event : events) {
+            if (covered < event[0]) {
+                covered = event[0];
+            }
+
+            if (covered < event[1]) {
+                int length = event[1] - covered;
+                int temp = (length + L - 1) / L;
+                covered += temp * L;
+                answer += temp;
+            }
+        }
+    }
+}
+```