Binary Search 1654

1
//만들 수 있는 랜선의 최대길이
2
#include <bits/stdc++.h>
3
#define fIO ios_base::sync_with_stdio(false); \
4
cin.tie(NULL);
5

6
using namespace std;
7
int main()
8
{
9
    fIO
10
    int K, N;
11
    cin >> K >> N;
12

13
    vector<int> lan(K);
14
    int max_len = 0;
15
    for(int i = 0; i < K; i++)
16
    {
17
        cin >> lan[i];
18
        max_len = max(max_len, lan[i]);
19
    }
20

21
    long long left = 1;
22
    long long right = max_len;
23
    long long mid = (left + right) / 2;
24

25
    while(left <= right)
26
    {
27
        int count = 0;
28
        for(int i = 0; i < K; i++)
29
        {
30
            count += lan[i] / mid;
31
        }
32

33
        if(count >= N)
34
        {
35
            left = mid + 1;
36
        }
37
        else
38
        {
39
            right = mid - 1;
40
        }
41
        mid = (left + right) / 2;
42
    }
43

44
    cout << mid << endl;
45

46
    return 0;
47
}