Pagini recente » Cod sursa (job #1248503) | Borderou de evaluare (job #804523) | Cod sursa (job #1494830) | Cod sursa (job #2307642) | Cod sursa (job #2528697)
#include <bits/stdc++.h>
using namespace std;
int a[1005],n,k;
int Test(int c)
{
int s,cnt;
s=0;cnt=1;
for(int i=1;i<=n;i++)
{
if(a[i]>c)return 0;
if(s+a[i]<=c)s+=a[i];
else
{
cnt++;
s=a[i];
}
}
return (cnt<=k);
}
int CB()
{
int st,dr,mij,p;
st=1;dr=1e9;
while(st<=dr)
{
mij=(st+dr)/2;
if(Test(mij)==1)
{
p=mij;
dr=mij-1;
}
else st=mij+1;
}
return p;
}
int main()
{
cin>>n>>k;
for(int i=1;i<=n;i++)
cin>>a[i];
cout<<CB();
return 0;
}