Pagini recente » Cod sursa (job #1638001) | Cod sursa (job #2690383) | Cod sursa (job #845644) | Cod sursa (job #2093323) | Cod sursa (job #2731585)
#include <fstream>
using namespace std;
int v[16003],mx,s,n,k;
int valid(int x){
int i,s1=0,t=1;
for(i=1;i<=n;++i){
if(s1+v[i]<=x){
s1=s1+v[i];
} else {
++t;
s1=v[i];
}
}
if(t<=k){
return 0;
} else {
return 1;
}
}
int bs(int x){
int st=mx,dr=s,mij,last;
while(st<=dr){
mij=(st+dr)/2;
if(valid(mij)==1){
st=mij+1;
} else {
dr=mij-1;
last=mij;
}
}
return last;
}
int main()
{
ifstream cin("transport.in");
ofstream cout("transport.out");
int i;
cin>>n>>k;
for(i=1;i<=n;++i){
cin>>v[i];
if(v[i]>mx){
mx=v[i];
}
s=s+v[i];
}
cout<<bs(n);
return 0;
}