[BOJ] 1654번 : 랜선 자르기

1. problem : 

https://www.acmicpc.net/problem/1654

 

2. solution 1 :

#include <bits/stdc++.h>
using namespace std;
int k, n;
int nums[10005];
typedef long long ll;

int main(void) {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> k >> n;
	for (int i = 0; i < k; i++) cin >> nums[i]; 

	ll left = 1ll; 
	ll right = *max_element(nums, nums + k); 
	ll answer = 0;
	while (left <= right) {
		ll mid = (left + right) / 2;
		int len_sum = 0;
		for (int i = 0; i < k; i++) {
			len_sum += nums[i] / mid; 
		}
		if (len_sum < n) right = mid - 1;
		else if (len_sum >= n) {
			left = mid + 1;
			answer = mid;
		}
	}
	cout << answer << '\n';
}