Pagini recente » Cod sursa (job #362565) | Cod sursa (job #175802) | Cod sursa (job #1265333) | Cod sursa (job #807698) | Cod sursa (job #1512677)
#include <fstream>
#define nmax 16005
using namespace std;
ifstream f1("transport.in");
ofstream f2("treansport.out");
int s[nmax],i,n,k;
void cit(){
f1>>n>>k;
for(i=1;i<=n;i++){
f1>>s[i];
}
}
int check(int x){
int sum=0,c=0;
for(i=1;i<=n;i++){
sum+=s[i];
if(sum>x){c++; sum=s[i];}
}
c++;
return c<=k;
}
int main(){
int l,r,sol,mid;
cit();
l=0;
r=nmax*nmax;
while(l<=r){
mid=(l+r)/2;
if(check(mid)){
sol=mid;
r=mid-1;
}
else{l=mid+1;}
}
f2<<sol<<"\n";
}