Pagini recente » Cod sursa (job #1966854) | Cod sursa (job #2522850) | Cod sursa (job #2514169) | Cod sursa (job #2724527) | Cod sursa (job #2784413)
#include <fstream>
using namespace std;
ifstream in ("transport.in");
ofstream out ("transport.out");
int v[16005];
int main()
{
int n,i,k,s,st,dr,mij,maxv,cnt,sum,sol;
in>>n>>k;
s=0;maxv=-1;
for(i=1;i<=n;++i)
{
in>>v[i];
if(v[i]>maxv)
maxv=v[i];
s=s+v[i];
}
st=maxv;dr=s;
while(st<=dr)
{
mij=(st+dr)/2;
cnt=0;sum=0;
for (i=1;i<=n && cnt<=k;++i)
{
if(sum+v[i]>mij)
{
cnt++;
sum=0;
}
sum=sum+v[i];
}
cnt++;
if (cnt>k)
st=mij+1;
else
{
sol=mij;
dr=mij-1;
}
sum=0;
}
out<<sol;
return 0;
}