Pagini recente » Cod sursa (job #1553456) | Cod sursa (job #1741847) | Cod sursa (job #526162) | Cod sursa (job #514320) | Cod sursa (job #1521538)
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int n,k,v[160001],c,maxi=0,ok=1;
int main()
{
f>>n>>k;
for(int i=1;i<=n;i++)
{
f>>v[i];
if(v[i]>maxi)
{
maxi=v[i];
}
}
while(ok)
{
int kk=k,load=0,i=1;
while(kk)
{
for(;i<=n;i++)
{
if(load+v[i]<=maxi)
{
load+=v[i];
if(i==n) ok=0;
}
else break;
}
if(load!=0)
{
kk--;
}
load=0;
}
if(ok) maxi++;
}
g<<maxi;
return 0;
}