Pagini recente » Cod sursa (job #929213) | Cod sursa (job #228253) | Cod sursa (job #620583) | Cod sursa (job #1866628) | Cod sursa (job #2528707)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int a[16005],n,k;
int Test(int t)
{
int cnt=1,s=0;
for(int i=1;i<=n;i++)
{
if(a[i]>t) return 0;
if(s+a[i]<=t){
s+=a[i];
}
else{
cnt++;
s=a[i];
}
}
return (cnt<=k);
}
int CB()
{
int st,dr,mij,p;
st=1;dr=16000*16000;
p=1;
while(st<=dr)
{
mij=(st+dr)/2;
if(Test(mij)==1)
{
p=mij;
dr=mij-1;
}
else st=mij+1;
}
return p;
}
int main()
{
fin>>n>>k;
for(int i=1;i<=n;i++)
fin>>a[i];
fout<<CB();
return 0;
}