Pagini recente » Istoria paginii runda/ojik | Istoria paginii runda/gim_4/clasament | Cod sursa (job #20631) | Cod sursa (job #2371653) | Cod sursa (job #2083500)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
const int N=16001;
int v[N],n,k,x;
bool sepoate(int c)
{
int cc=0;
int nr=0;
for(int i=1;i<=n;i++)
{
if(v[i]>c)
return false;
if(v[i]>cc)
{
nr++;
cc=c;
}
cc-=v[i];
}
return (nr<=k);
}
int main()
{
int pas,r;
in>>n>>k;
for(int i=1;i<=n;i++)
in>>v[i];
pas=1<<27;
r=0;
while(pas!=0)
{
if(!sepoate(r+pas))
r+=pas;
pas/=2;
}
r++;
out<<r;
return 0;
}