From d303c416f02e47a97abd95be68170d3574dabe76 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=EA=B0=95=EC=8B=A0=EC=A7=80?= <101992179+ksinji@users.noreply.github.com> Date: Thu, 13 Nov 2025 16:56:15 +0900 Subject: [PATCH 1/2] =?UTF-8?q?Rename=20ksinji/11=20PGM=20=EB=8F=84?= =?UTF-8?q?=EB=91=91=EC=A7=88.md=20to=20ksinji/202511/11=20PGM=20=EB=8F=84?= =?UTF-8?q?=EB=91=91=EC=A7=88.md?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../202511/11 PGM \353\217\204\353\221\221\354\247\210.md" | 0 1 file changed, 0 insertions(+), 0 deletions(-) rename "ksinji/11 PGM \353\217\204\353\221\221\354\247\210.md" => "ksinji/202511/11 PGM \353\217\204\353\221\221\354\247\210.md" (100%) diff --git "a/ksinji/11 PGM \353\217\204\353\221\221\354\247\210.md" "b/ksinji/202511/11 PGM \353\217\204\353\221\221\354\247\210.md" similarity index 100% rename from "ksinji/11 PGM \353\217\204\353\221\221\354\247\210.md" rename to "ksinji/202511/11 PGM \353\217\204\353\221\221\354\247\210.md" From 4234d97ad23667c4319c45a1c24b21499e665599 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=EA=B0=95=EC=8B=A0=EC=A7=80?= <101992179+ksinji@users.noreply.github.com> Date: Thu, 13 Nov 2025 17:02:36 +0900 Subject: [PATCH 2/2] =?UTF-8?q?[20251113]=20PGM=20/=20LV3=20/=20=EB=8B=A8?= =?UTF-8?q?=EC=86=8D=EC=B9=B4=EB=A9=94=EB=9D=BC=20/=20=EA=B0=95=EC=8B=A0?= =?UTF-8?q?=EC=A7=80?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- ...15\354\271\264\353\251\224\353\235\274.md" | 24 +++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 "ksinji/202511/13 PGM \353\213\250\354\206\215\354\271\264\353\251\224\353\235\274.md" diff --git "a/ksinji/202511/13 PGM \353\213\250\354\206\215\354\271\264\353\251\224\353\235\274.md" "b/ksinji/202511/13 PGM \353\213\250\354\206\215\354\271\264\353\251\224\353\235\274.md" new file mode 100644 index 00000000..46a789e9 --- /dev/null +++ "b/ksinji/202511/13 PGM \353\213\250\354\206\215\354\271\264\353\251\224\353\235\274.md" @@ -0,0 +1,24 @@ +```java +import java.util.*; + +class Solution { + public int solution(int[][] routes) { + Arrays.sort(routes, (a, b) -> Integer.compare(a[1], b[1])); + + int answer = 0; + int camera = Integer.MIN_VALUE; + + for (int[] r : routes){ + int s = r[0]; + int e = r[1]; + + if (camera < s){ + camera = e; + answer++; + } + } + + return answer; + } +} +```