Pagini recente » Cod sursa (job #2836239) | Cod sursa (job #525878) | Istoria paginii runda/simulare_oji_a_10-a/clasament | Cod sursa (job #1513112) | Cod sursa (job #1799350)
#include <cstdio>
using namespace std;
int v[16010];
int main()
{
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
int n,k,s=0,maxx=0,st,dr,mid,p;
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++)
{
scanf("%d",&v[i]);
if(v[i]>maxx) maxx=v[i];
s+=v[i];
}
st=maxx;dr=s;
while(st<=dr)
{
mid=(st+dr)/2;
p=0;s=mid;
for(int i=1;i<=n;i++)
if(v[i]<=s) s-=v[i];
else {s=mid-v[i];p++;}
p++;
if(p<=k) dr=mid-1;
else st=mid+1;
}
printf("%d",st);
return 0;
}