Pagini recente » Borderou de evaluare (job #1155276) | Cod sursa (job #1431170) | Profil dianagabiriela | Cod sursa (job #1815259) | Cod sursa (job #2426947)
#include <fstream>
using namespace std;
const int NMAX=16000;
int n,c[NMAX], k;
ifstream in("transport.in");
ofstream out("transport.out");
bool se_poate(int v)
{
int cc=0, nrt=0;
for (int i=0; i<n; i++)
{
if (c[i]>v)
{
return false;
}
if (c[i]>cc)
{
nrt++;
cc=v;
}
cc-=c[i];
}
return (nrt<=k);
}
int main()
{
in >> n >> k;
for (int i=0; i<n; i++)
{
in >> c[i];
}
int v=1;
while(!se_poate(v))
{
v++;
}
out << v;
in.close();
out.close();
return 0;
return 0;
}