백준 - 1654 랜선 자르기

문제 링크입니다 : https://www.acmicpc.net/problem/1654

1654번: 랜선 자르기

 

이분 탐색 문제!

 

 

 

 

 

#include <iostream>
#include <vector>

using namespace std;
typedef long long ll;

int K, N;
vector<ll> cable;

int main() {
    cin >> K >> N;
    cable.resize(K);

    ll low = 0, high = 0;
    for(int i = 0; i < K; i++) {
        cin >> cable[i];
        if(cable[i] > high) {
            high = cable[i];
        }
    }

    ll mid, result = 1;

    while(low <= high) {
        mid = (low + high) / 2;

        if(mid == 0) {
            break;
        }
        ll cableNum = 0;
        for(int i = 0; i < K; i++) {
            cableNum += cable[i] / mid;
        }

        if(cableNum >= N) {
            low = mid + 1;
            result = mid;
        } else {
            high = mid - 1;
        }
    }

    cout << result;

    return 0;
}

 

 

 

 

개발 환경 : vscode

지적, 조언, 질문 환영입니다! 댓글 남겨주세요~