Pagini recente » Cod sursa (job #2792528) | Cod sursa (job #1317584) | Cod sursa (job #67321) | Cod sursa (job #2324666) | Cod sursa (job #2074143)
#include <fstream>
using namespace std;
ifstream in ("transport.in");
ofstream out ("transport.out");
const int N=16002;
int v[N],n,k;
bool verif(int l)
{
int i,s=0,cnt=0;
for (i=1;i<=n;i++)
{
if (v[i]>s)
cnt++, s=l;
if (v[i]>s)
return false;
if (cnt>k)
return false;
s-=v[i];
}
return true;
}
int main()
{
int i,r=0,pas=1<<30;
in>>n>>k;
for (i=1;i<=n;i++)
in>>v[i];
while (pas)
{
if (verif(r+pas)==0)
r+=pas;
pas/=2;
}
out<<r+1;
return 0;
}