Pagini recente » Cod sursa (job #1629646) | Cod sursa (job #1003097) | Cod sursa (job #2260248) | Cod sursa (job #2565455) | Cod sursa (job #1961518)
#include <cstdio>
#include <iostream>
using namespace std;
int main()
{
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
int n,l1,l2,elem,m,t,s,i,v[16001],k;
cin>>n>>k;
l1=0;
l2=0;
for(i=1; i<=n; i++)
{
cin>>v[i];
if(l1<v[i])
l1=v[i];
l2=l2+v[i];
}
while(l1<=l2)
{
m=(l1+l2)/2;
t=1;
s=0;
for(i=1; i<=n; i++){
if(s+v[i]<=m)
s=s+v[i];
else
{
t++;
s=v[i];
}
}
if(t>k)
l1=m+1;
else
{
l2=m-1;
elem=m;
}
}
cout<<elem;
return 0;
}