Merge pull request #249 from AlgoLeadMe/31-H0ngJu

31-H0ngJu

H0ngJu/README.md

@@ -30,7 +30,6 @@
 | 26차시 | 2024.08.24 |  그리디  |                   [신입사원](https://www.acmicpc.net/problem/1946)                    | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/237 |
 | 27차시 | 2024.08.27 |   DFS    |                  [트리의 지름](https://www.acmicpc.net/problem/1967)                  | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/240 |
 | 28차시 | 2024.09.04 | 벨만포드 |                   [타임머신](https://www.acmicpc.net/problem/11657)                   | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/244 |
-| 29차시 | 2024.09.06 |   구현   |                   [톱니바퀴](https://www.acmicpc.net/problem/14891)                   | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/245 |
+| 29차시 | 2024.09.06 |   구현   |[톱니바퀴](https://www.acmicpc.net/problem/14891)                   | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/245 |
 | 30차시 | 2024.09.27 |   수학   |         [Fly me to the Alpha Centauri](https://www.acmicpc.net/problem/1011)          | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/248 |
-
----
+| 31차시 | 2024.10.05 | 정렬 | [선 긋기](https://www.acmicpc.net/problem/2170) | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/249 |

H0ngJu/정렬/선 긋기.py

@@ -0,0 +1,26 @@
+import sys
+
+def input() : return sys.stdin.readline().rstrip()
+
+length = 0
+start = 0
+end = 0
+
+N = int(input())
+lines = [tuple(map(int, input().split())) for _ in range(N)]
+lines.sort()
+
+for i in range(N):
+    x, y = lines[i]
+    if i == 0:
+        start = x
+        end = y
+    else:
+        if x<= end:
+            end = max(end, y)
+        else:
+            length += abs(end-start) # 이전 선분은 필요 없음
+            start = x
+            end = y
+
+print(abs(end-start + length))