From 71c825ba2e687be17050123880d97e2da6698774 Mon Sep 17 00:00:00 2001 From: JHLEE325 <82587652+JHLEE325@users.noreply.github.com> Date: Fri, 7 Nov 2025 09:14:37 +0900 Subject: [PATCH] =?UTF-8?q?[20251107]=20BOJ=20/=20G3=20/=20=EC=88=98?= =?UTF-8?q?=EC=83=81=20=ED=83=9D=EC=8B=9C=20/=20=EC=9D=B4=EC=A4=80?= =?UTF-8?q?=ED=9D=AC?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- ...30\354\203\201\355\203\235\354\213\234.md" | 61 +++++++++++++++++++ 1 file changed, 61 insertions(+) create mode 100644 "JHLEE325/202511/07 BOJ G3 \354\210\230\354\203\201\355\203\235\354\213\234.md" diff --git "a/JHLEE325/202511/07 BOJ G3 \354\210\230\354\203\201\355\203\235\354\213\234.md" "b/JHLEE325/202511/07 BOJ G3 \354\210\230\354\203\201\355\203\235\354\213\234.md" new file mode 100644 index 00000000..5b804490 --- /dev/null +++ "b/JHLEE325/202511/07 BOJ G3 \354\210\230\354\203\201\355\203\235\354\213\234.md" @@ -0,0 +1,61 @@ +```java +import java.io.*; +import java.util.*; + +public class Main { + static class taxi implements Comparable { + int start, end; + taxi(int s, int e) { + this.start = s; + this.end = e; + } + public int compareTo(taxi 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 = new StringTokenizer(br.readLine()); + int N = Integer.parseInt(st.nextToken()); + int M = Integer.parseInt(st.nextToken()); + + List list = new ArrayList<>(); + for (int i = 0; i < N; i++) { + st = new StringTokenizer(br.readLine()); + int a = Integer.parseInt(st.nextToken()); + int b = Integer.parseInt(st.nextToken()); + if (a > b) { + list.add(new taxi(b, a)); + } + } + + if (list.isEmpty()) { + System.out.println(M); + return; + } + + Collections.sort(list); + + long extra = 0; + int curStart = list.get(0).start; + int curEnd = list.get(0).end; + + for (int i = 1; i < list.size(); i++) { + taxi t = list.get(i); + if (t.start <= curEnd) { + curEnd = Math.max(curEnd, t.end); + } else { + extra += (long)(curEnd - curStart) * 2; + curStart = t.start; + curEnd = t.end; + } + } + extra += (long)(curEnd - curStart) * 2; + + long answer = M + extra; + System.out.println(answer); + } +} +```