[Week6] 김재원 : 수리공 항승, 신입 사원, 동전 0, 잃어버린 괄호, 큰 수 만들기

src/6week/jaewon/동전.kt

@@ -0,0 +1,18 @@
+package `6week`.jaewon
+
+fun main(){
+    var(n,k) = readln().split(" ").map {it.toInt()}
+    val coinList = mutableListOf<Int>()
+    var answer = 0
+
+    repeat(n){
+        coinList.add(readln().toInt())
+    }
+
+    coinList.reversed().forEach {
+        if(k == 0 ){ return@forEach }
+        answer += k/it
+        k %= it
+    }
+    print(answer)
+}

src/6week/jaewon/수리공 항승.kt

@@ -0,0 +1,16 @@
+package `6week`.jaewon
+
+fun main(){
+    val (_,l) = readln().split(" ").map{it.toInt()}
+    val location = readln().split(" ").map{it.toInt()}.sorted()
+    var current = 0;
+    var cnt = 0;
+
+    location.forEach {
+        if(it+0.5 > current){
+            cnt++
+            current = it+l
+        }
+    }
+    print(cnt)
+}

src/6week/jaewon/신입 사원.kt

@@ -0,0 +1,21 @@
+package `6week`.jaewon
+
+fun main(){
+    val t = readln().toInt()
+    repeat(t){
+        val n = readln().toInt()
+        val result = mutableListOf<Pair<Int,Int>>()
+        var answer = 0
+        repeat(n){
+            val (a,b) = readln().split(" ").map{it.toInt()}
+            result.add(Pair(a,b))
+        }
+
+        result.forEach { oneResult ->
+            if(result.filter{ it.first < oneResult.first }.none{it.second < oneResult.second}){
+                answer++
+            }
+        }
+        print(answer)
+    }
+}

src/6week/jaewon/잃어버린 괄호.kt

@@ -0,0 +1,8 @@
+package `6week`.jaewon
+
+fun main(){
+    print(readln()
+        .split("-")
+        .map{it.split("+").map { it.toInt() }.reduce { acc, s -> acc+s }}
+        .reduce{total,num -> total-num})
+}

src/6week/jaewon/큰 수 만들기.kt

@@ -0,0 +1,37 @@
+package `6week`.jaewon
+
+import java.util.Stack
+
+class `큰 수 만들기` {
+    companion object {
+        fun getSolution(): Solution {
+            return Solution()
+        }
+    }
+
+    class Solution{
+        fun solution(number: String, k: Int): String {
+            var answer = ""
+            var start = 0
+            while (start < number.length && answer.length != number.length-k){
+                val front = k + answer.length +1
+                var max = 0
+                for(i in start until front){
+                    if(max < number[i].digitToInt()){
+                        max = number[i].digitToInt()
+                        start = i +1
+                    }
+                }
+                answer = "${answer}${max}"
+            }
+            return answer
+        }
+    }
+}
+
+fun main() {
+    val solution = `큰 수 만들기`.getSolution()
+    println(solution.solution("1924",2))
+    println(solution.solution("1231234",3))
+    println(solution.solution("4177252841",4))
+}