[백준 1654번] 랜선 자르기

소스코드

---

#include <iostream>
using namespace std;
 
int main() {
    int n, k;
    long long l = 0, r, a[10001],range=0, Max = 0;
    cin >> k >> n;
    for (int i = 0; i < k; i++) {
        cin >> a[i];
        if (range < a[i])
            range = a[i];
    }
    r = range;
    while(l<=r) {
        long long mid = (l + r) / 2;
        int line = 0;
        for (int i = 0; i < k; i++)
            line += (a[i]/mid);
        
        if (line < n) 
            r = mid-1;
        else {
            l = mid+1;
            if (mid > Max)
                Max = mid;
        }
    }
    cout << Max;
    return 0;
}