Pagini recente » Cod sursa (job #676544) | Istoria paginii utilizator/mieii_fiorosi | Cod sursa (job #862854) | Cod sursa (job #2015367) | Cod sursa (job #1415718)
#include <fstream>
#include <cstdio>
#define NM 16005
using namespace std;
int n,k,i,sum,mx,v[NM],x,nr;
bool ok;
int main()
{
freopen("transport.in", "r", stdin);
freopen("transport.out", "w", stdout);
scanf("%d %d", &n, &k);
for (i=1; i<=n; i++)
{
scanf("%d", &v[i]);
mx=max(mx, v[i]);
sum+=v[i];
}
sum/=k;
x=mx;
while (x<=NM)
{
ok=true;
nr=sum=0;
for (i=1; i<=n; i++)
{
if (sum+v[i]>x)
{
nr++;
sum=v[i];
}
else
sum+=v[i];
if (nr>=k)
{
ok=false;
break;
}
}
if (ok==true)
{
printf("%d\n", x);
break;
}
x++;
}
return 0;
}