洛谷 P2440. 木材加工
原题链接
中等
作者:
我是java同学
,
2024-01-10 11:06:31
,
所有人可见
,
阅读 28
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 100010;
int n, m;
int w[N];
bool check(int mid) {
LL res = 0;
if (!mid) return false;
for (int i = 0; i < n; i ++ )
res += w[i] / mid;
return res >= m;
}
int main() {
scanf("%d%d", &n, &m);
int l = 0, r = 0;
for (int i = 0; i < n; i ++ ) {
scanf("%d", &w[i]);
r = max(r, w[i]);
}
while (l < r) {
int mid = l + r + 1 >> 1;
if (check(mid)) l = mid;
else r = mid - 1;
}
if (r >= 1) cout << r << endl;
else cout << 0 << endl;
return 0;
}