Pagini recente » Cod sursa (job #1852192) | Cod sursa (job #801036) | Cod sursa (job #424926) | Cod sursa (job #2116238) | Cod sursa (job #1418731)
#include<fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,k,v[16005];
int i,r,p,u,mid;
int vf(int x){
int s=0;
int K=0;
for(int i=1;i<=n;i++){
s+=v[i];
if(s>x){
K++;
s=v[i];
}
}
if(s!=0){
K++;
}
if(K<=k){
return 1;
}
return 0;
}
int main(){
fin>>n>>k;
for(i=1;i<=n;i++){
fin>>v[i];
}
p=1;
u=16001*16001;
while(p<=u){
mid=(p+u)/2;
r=vf(mid);
if(r==0){
p=mid+1;
}else{
u=mid-1;
}
}
fout<<p<<"\n";
return 0;
}