XX2437 分金条 C++解决

AC code

#include<bits/stdc++.h>
using namespace std;
bool check(int arr[],int m,int n,int k)
{
    int cnt=0;
	for(int i=0;i<=n-1;i++)
    {
        cnt = cnt + ceil(1.0*arr[i]/m); 
    }
        if(cnt<=k) return true;
        else return false;
}
int main()
{
        int n,k;
        cin>>n>>k;
        int arr[n];
        for(int i=0;i<=n-1;i++)cin>>arr[i]; 
        int left = 0,right = 9999,mid=0;
        int ans =0;
        while(left<=right)
        {
            mid = (left +right)/2;
            if(check(arr,mid,n,k))
            {
                ans =mid;
				right=mid-1;
            }
            else
            {
                left =mid +1;
            }
        }
        cout<<ans;
        return 0;
}