Pagini recente » Cod sursa (job #3361933) | Cod sursa (job #3362013) | Monitorul de evaluare | Cod sursa (job #3357902) | Cod sursa (job #3361755)
#include <fstream>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int v[16005];
int main()
{
int n,k;
cin>>n>>k;
int st=0,dr=0;
for(int i=1;i<=n;i++)
{
cin>>v[i];
if(v[i]>st)
{
st=v[i];
}
dr+=v[i];
}
while(st<dr)
{
int mij=(st+dr)/2;
int nr=1,s=0;
for(int i=1;i<=n;i++)
{
if(s+v[i]<=mij)
{
s+=v[i];
}
else
{
nr++;
s=v[i];
}
}
if(nr<=k)
{
dr=mij;
}
else
{
st=mij+1;
}
}
cout<<st;
return 0;
}