Pagini recente » Cod sursa (job #731219) | Cod sursa (job #461659) | Cod sursa (job #1956834) | Cod sursa (job #2927777) | Cod sursa (job #2675283)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,k,maxim=0,suma=0;
int v[16005];
bool Verificare(int x)
{
int s=0,t=0;
for(int i=1;i<=n;i++)
{
if(s+v[i]>x)
{
s=v[i];
t++;
if(t>k)
return 0;
}
else
s+=v[i];
}
if(t>=k)
return 0;
return 1;
}
int main()
{
fin>>n>>k;
for(int i=1;i<=n;i++)
{
fin>>v[i];
maxim=max(maxim,v[i]);
suma+=v[i];
}
int st=maxim,dr=suma,sol=-1;
while(st<=dr)
{
int mij=(st+dr)/2;
if(Verificare(mij))
{
sol=mij;
dr=mij-1;
}
else
st=mij+1;
}
fout<<st;
return 0;
}