Pagini recente » Cod sursa (job #1292771) | Cod sursa (job #1790736) | Cod sursa (job #984779) | Cod sursa (job #803984) | Cod sursa (job #1033979)
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int a[16001], n, k;
int st, dr=16001, s, aux, mid;
int main()
{
fin>>n>>k;
for(int i=1; i<=n; i++)
{
fin>>a[i];
if(a[i]>st)
st=a[i];
}
while(st<=dr)
{
s=0;
aux=1;
mid=(st+dr)/2;
for(int i=1; i<=n; i++)
if (s+a[i]<=mid)
s+=a[i];
else
{
s=a[i];
aux++;
}
if (aux>k)
st=mid+1;
else
dr=mid-1;
}
fout<<st<<'\n';
return 0;
}