Pagini recente » Cod sursa (job #1609594) | Cod sursa (job #367597) | Cod sursa (job #1743496) | Cod sursa (job #2524766) | Cod sursa (job #2266934)
#include <bits/stdc++.h>
using namespace std;
int n,k,a[17000],l,r,m,poz,curr,ans,s;
int main()
{
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
cin>>n>>k;
for(int i=1;i<=n;i++) cin>>a[i];
l=1;
r=330000000;
while(l<=r)
{
m=(l+r)/2;
s=0;
curr=1;
for(int i=1;i<=n;i++)
{
if(s+a[i]<=m) {
s+=a[i];
}
else
{
s=a[i];
curr++;
}
}
if(curr<=k)
{
r=m-1;
ans=m;
}
else l=m+1;
}
cout<<ans;
return 0;
}