Merge pull request #57 from AlgoLeadMe/16-alstjr7437

16-alstjr7437

alstjr7437/README.md

@@ -17,3 +17,4 @@
 | 13차시 | 2024.02.29 |  DP  | <a href="https://www.acmicpc.net/problem/10844">쉬운 계단 수</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/42 |
 | 14차시 | 2024.03.03 |  브루트포스  | <a href="https://www.acmicpc.net/problem/18111">마인크래프트</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/48 |
 | 15차시 | 2024.03.09 |  우선순위 큐  | <a href="https://www.acmicpc.net/problem/13975">파일 합치기3</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/53 |
+| 16차시 | 2024.03.13 |  정렬  | <a href="https://www.acmicpc.net/problem/2170">선 긋기</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/57 |

alstjr7437/정렬/tempCodeRunnerFile.py

@@ -0,0 +1,3 @@
+
+#     dohwaji[i][0] += 1000000000
+#     dohwaji[i][1] += 1000000000

alstjr7437/정렬/선 긋기.py

@@ -0,0 +1,27 @@
+import sys
+input = sys.stdin.readline
+
+n = int(input())
+dohwaji = [tuple(map(int,(input().split()))) for _ in range(n)]
+
+# for i in range(len(dohwaji)):
+#     dohwaji[i][0] += 1000000000
+#     dohwaji[i][1] += 1000000000
+
+dohwaji.sort()
+
+line = dohwaji[0][1]
+answer = dohwaji[0][1] - dohwaji[0][0]
+
+for left, right in dohwaji[1:]:
+    if right <= line:
+        continue
+    elif line < left:
+        answer += right - left
+        line = right
+    elif line >= left and right > line: 
+        answer += right - line
+        line = right
+    # print(answer)
+
+print(answer)