We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 1066a43 commit 3198008Copy full SHA for 3198008
src/3week/jaewon/랜선 자르기.kt
@@ -0,0 +1,29 @@
1
+/**
2
+ * 어떻게 풀어야 할지 감이 안잡힘...
3
+ * ㅇㅏ이디어 : 이분탐색
4
+ *
5
+ */
6
+
7
+fun main(){
8
+ val (k,n) = readln().split(" ").map { it.toInt() }
9
+ val size = IntArray(k)
10
+ repeat(k){ size[it] = readln().toInt()}
11
12
+ var answer : Long = 0
13
+ var high : Long = size.maxOf { it }+1.toLong()
14
+ var row : Long = 1
15
+ while (row <= high){
16
+ val mid : Long = (high+row)/2
17
+ var temp : Long = 0
18
+ size.forEach {
19
+ temp += it/mid
20
+ }
21
+ if (temp >= n){
22
+ row = mid+1
23
+ answer = mid
24
+ }else{
25
+ high = mid-1
26
27
28
+ println(answer)
29
+}
0 commit comments