Pagini recente » Cod sursa (job #1505003) | Cod sursa (job #2578508) | Cod sursa (job #940636) | Cod sursa (job #2657550) | Cod sursa (job #2209621)
#include <fstream>
#include <cmath>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int n,suma,k,a[16001],maxim;
void citire()
{
cin>>n>>k;
for(int i=1;i<=n;++i)
{ cin>>a[i];
suma+=a[i];
maxim=max(a[i],maxim);
}
}
int cautare(int s,int d)
{
while(s<d)
{
int m=(s+d)/2;
int sum=0,ct=0;
for(int i=1;i<=n;++i)
{
sum+=a[i];
if(sum>m)
{++ct;
sum=a[i];
}
if(ct>k)break;
}
++ct;
if(ct<=k)d=m-1;
else s=m+1;
}
return s;
}
int main()
{
citire();
cout<<cautare(maxim,suma);
return 0;
}