P2440 木材加工

传送门

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int inf = 0x3f3f3f3f;
ll a[100010];
int n,k;
bool check(ll x)
{
	int cnt = 1;
	for(int i = n; i >= 1; i--)
	{
		cnt += a[i]/x;
		if(cnt > k)
		break;
	}
	if(cnt > k) return false;
	return true;
}
int main()
{
	cin>>n>>k;
	ll l = 1,r = 0;
	for(int i = 1; i <= n; i++)
	{
		cin>>a[i];
		r = max(r,a[i]);
	}
	sort(a+1,a+1+n);
	while(l <= r)
	{
		ll mid = (l+r)/2;
		if(mid == 0)
		{
			cout<<"0"<<endl;
			break;
		}
		if(check(mid))
		{
			r = mid-1;
		
		}
		else
		{
			l = mid+1;
		}
	}
	printf("%d\n",r);
}