Pagini recente » Cod sursa (job #2766342) | Cod sursa (job #1856700) | Cod sursa (job #961095) | Cod sursa (job #2138734) | Cod sursa (job #3000735)
#include<iostream>
#include<fstream>
using namespace std;
int v[20000];
int s=0;
bool incape(int c,int n,int k){
for(int i=1;i<=n;i++){
//de corectat
s=s+v[i];
if(s>c){
s=v[i];
k--;
return true;
}
}
}
int cautarebinara(int k,int n,int med){
int st;//de corectat
int dr;
int ans;
while(st<=dr){
int med=(st+dr)/2;
if(incape(k,med,n)){
dr=med-1;
ans=med;
}
else{
st=med+1;
}
}
return ans;
}
ifstream fin ("transport.in");
ofstream fout("transport.out");
int main(){
int n,k;
int med;
fin>>n>>k;
for(int i=1;i<=n;i++){
int x;
fin>>x;
}
fout<<cautarebinara(k,n,med);
}