Pagini recente » Cod sursa (job #83505) | Cod sursa (job #2375348) | Cod sursa (job #2349644) | Cod sursa (job #2987026) | Cod sursa (job #519447)
Cod sursa(job #519447)
#include<iostream>
#include<fstream>
using namespace std;
int n,k,sal[16000],mi;
void citire(){
ifstream in("transport.in");
in>>n>>k;
int i;
for(i=0;i<n;i++){
in>>sal[i];
if(sal[i]>mi)mi=sal[i];
}
}
int mini(){
int i,count,minim=mi,s;
while(minim){
count=0;
i=0;
while(i<n){
s=0;
while(i<n){
if(s+sal[i]<=minim)s+=sal[i++];
else break;
}
count++;
}
if(count<=k)return minim;
else minim++;
}
}
int main(){
citire();
ofstream out("transport.out");
out<<mini();
out.close();
return 0;
}