Pagini recente » Cod sursa (job #2821402) | Cod sursa (job #1466389) | Cod sursa (job #696281) | Cod sursa (job #900260) | Cod sursa (job #2976556)
#include <fstream>
using namespace std;
ifstream cin ("transport.in");
ofstream cout ("transport.out");
int main()
{
int n, i, k, v[16001], st=-1, dr=0,m,nr,s,sol;
cin>>n>>k;
for(i=1;i<=n;i++)
{
cin>>v[i];
if(v[i]>st) st=v[i];
dr=dr+v[i];
}
while(st<=dr)
{
m=(st+dr)/2;
s=0;
nr=0;
for(i=1;i<=n;i++)
{
s=s+v[i];
if(s>m)
{
nr++;
s=v[i];
}
}
nr++;
if(nr>k)
{
st=m+1;
}
else
{
sol=m;
dr=m-1;
}
}
cout<<sol;
return 0;
}