Pagini recente » Cod sursa (job #1185236) | Cod sursa (job #1061320) | Cod sursa (job #1999909) | Cod sursa (job #1720838) | Cod sursa (job #2082769)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
int n,k,v[16001];
int whatamidoingwithmylife(int f){
int ff=f, nr=1;
for(int i=0;i<n;i++){
if(v[i]>f) {
return false;
}
if(v[i]>ff){
nr++;
ff=f;}
ff-=v[i];
if(nr>k)
return false;
}
return true;
}
int main()
{
in>>n>>k;
for(int i=0;i<n;i++)
in>>v[i];
int pas=1<<27, r=0;
while(pas!=0){
if(!whatamidoingwithmylife(r+pas)) {
r+=pas;
}
pas/=2;
}
r++;
out<<r;
return 0;
}