Pagini recente » Cod sursa (job #723954) | Cod sursa (job #2493874) | Cod sursa (job #1944169) | Cod sursa (job #1232566) | Cod sursa (job #1711593)
#include <fstream>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int v[16300];
int main()
{
int n,k,i,max=-1,drumuri=-1,nr,sc;
cin>>n>>k;
for(i=1;i<=n;i++)
{
cin>>v[i];
if(v[i]>max)
max=v[i];
}
nr=max;
while(drumuri==-1||drumuri>k)
{
drumuri=0;
sc=0;
for(i=1;i<=n;i++)
{
sc+=v[i];
if(sc>nr)
{
sc=0;
drumuri++;
}
}
nr++;
}
cout<<nr;
cin.close();
cout.close();
return 0;
}