Pagini recente » Cod sursa (job #411759) | Cod sursa (job #2283130) | Profil mihnea.anghel | Cod sursa (job #38071) | Cod sursa (job #2297035)
#include <fstream>
#define lim 16000
using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
int a[lim+5],n,k,st,dr,mij,c,s;
int verif(int x)
{
int cont=0, sum=0;
for(int i=1;i<=n;i++)
{
if(sum+a[i]>x)
{
cont++;
sum=0;
}
sum+=a[i];
}
return cont+1;
}
int main()
{
in>>n>>k;
for(int i=1;i<=n;i++)
{
in>>a[i];
s+=a[i];
}
st=1;
dr=s;
c=-1;
while(st<=dr)
{
mij=(st+dr)/2;
if(verif(mij)>k)
st=mij+1;
else
{
c=mij;
dr=mij-1;
}
}
out<<c;
return 0;
}