Pagini recente » Cod sursa (job #3125677) | Cod sursa (job #3158706) | Cod sursa (job #467132) | Cod sursa (job #653474) | Cod sursa (job #2558472)
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
const int NMAX=16005;
int v[NMAX],n,k;
bool ok(int med)
{
int s=0,i,cnt=0;
for(i=1;i<=n;i++)
{
if(v[i]>med)
return 0;
if(s+v[i]<=med)
s+=v[i];
else
{
s=v[i];
cnt++;
}
}
if(s!=0)
cnt++;
if(cnt<=k)
return 1;
return 0;
}
int bs(int st,int dr)
{
int med,last=-1;
bool rez;
while(st<=dr)
{
med=st+(dr-st)/2;
rez=ok(med);
if(rez)
{
last=med;
dr=med-1;
}
else
st=med+1;
}
return last;
}
int main()
{
int s=0,i;
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>v[i];
s+=v[i];
}
fout<<bs(1,s);
return 0;
}