Merge pull request #38 from AlgoLeadMe/10-SeongHoonC

10-SeongHoonC

SeongHoonC/README.md

@@ -11,4 +11,5 @@
 | 7차시 | 2024.02.08 | DP | <a href="https://www.acmicpc.net/problem/1932"></a> | https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/23 |
 | 8차시 | 2024.02.14 | 정렬 | <a href="https://www.acmicpc.net/problem/18870"></a> | https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/26 |
 | 9차시 | 2024.02.21 | bfs | <a href="https://www.acmicpc.net/problem/21736"></a> | https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/35 |
+| 9차시 | 2024.02.23 | 그리디 | <a href="https://www.acmicpc.net/problem/1931"></a> | https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/38 |
 ---

SeongHoonC/greedy/회의실 배정.kt

@@ -0,0 +1,35 @@
+import java.io.BufferedReader
+import java.io.InputStreamReader
+
+fun main() {
+    val br = BufferedReader(InputStreamReader(System.`in`))
+    val n = br.readLine().toInt()
+    var meets = mutableListOf<Pair<Int, Int>>()
+
+    for (i in 0 until n) {
+        val (x, y) = br.readLine().split(" ").map { it.toInt() }
+        meets.add(x to y)
+    }
+    meets.sortWith(compareBy({ it.second }, { it.first }))
+
+    var min = -1
+    var count = 0
+    for (i in meets.indices) {
+        val meet = meets[i]
+        // 회의 시작이 이미 시작한 회의보다 작으면 회의 못함
+        if (meet.first < min) {
+            continue
+        }
+        // 회의 끝이 최소값보다 작으면 갱신하고 +1
+        if (meet.second > min) {
+            min = meet.second
+            count++
+            continue
+        }
+        // 회의 시작과 끝이 같으면 +1
+        if (meet.first == meet.second) {
+            count++
+        }
+    }
+    println(count)
+}