Pagini recente » Cod sursa (job #1216549) | Cod sursa (job #172347) | Cod sursa (job #1588040) | Cod sursa (job #1652078) | Cod sursa (job #1262085)
#include <fstream>
using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
int n,k,v[16005];
bool ok(long long int a)
{
long long int tr=1,suma=0;
for(long long int i=1;i<=n;i++)
{
if(suma+v[i]<=a)
suma=suma+v[i];
else
if(v[i]<=a)
{
suma=v[i];
tr++;
}
else
{
return 0;
}
}
if(tr<=k)
return 1;
return 0;
}
long long int bs(long long int st,long long int dr)
{
long long int med, last=-1;
while(st<=dr)
{med=(st+dr)>>1;
if(ok(med))
{
last=med;
dr=med-1;
}
else
st=med+1;}
return last;
}
int main()
{
long long int s=0,a;
in>>n>>k;
for(int i=1;i<=n;i++)
{
in>>v[i];
s=s+v[i];
}
a=bs(1,s);
out<<a;
return 0;
}