Pagini recente » Cod sursa (job #1249618) | Cod sursa (job #1623919) | Cod sursa (job #1943239) | Cod sursa (job #1744539) | Cod sursa (job #2422883)
#include<fstream>
using namespace std;
int v[16001];
int main(){
ifstream cin("transport.in");
ofstream cout("transport.out");
int n,i,k,st,dr,mij,rez,s,nrt;
cin>>n>>k;
st=-1;
dr=0;
for(i=1;i<=n;i++)
{
cin>>v[i];
if(st<v[i])
st=v[i];
dr=dr+v[i];
}
while(st<=dr)
{
mij=(st+dr)/2;
s=0;
nrt=1;
for(i=1;i<=n;i++)
{
if(s+v[i]<=mij)
s=s+v[i];
else
{
s=v[i];
nrt++;
}
}
if(nrt>k)
st=mij+1;
else{
rez=mij;
dr=mij-1;
}
}
cout<<rez;
return 0;
}