Pagini recente » Cod sursa (job #1585578) | Cod sursa (job #1672161) | Cod sursa (job #1325186) | Cod sursa (job #2224775) | Cod sursa (job #3005343)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int main(){
int n, k, v[1600];
fin >> n >> k;
for(int i=1; i<=n; i++)
fin >> v[i];
for(int p=1; p<=n; p++){
int mx=0, s=0, tr=1;
for(int e=1; e<=p; e++)
mx+=v[e];
for(int i=1; i<=n; i++){
if(s+v[i]<=mx)
s+=v[i];
else if(s+v[i]>mx){
s=v[i];
tr++;
}
}
if(tr<=k){
fout << mx;
break;
}
}
}