Pagini recente » Cod sursa (job #2472070) | Cod sursa (job #1169406) | Cod sursa (job #2186553) | Cod sursa (job #1957108) | Cod sursa (job #2062320)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int v[17000],n;
int nt(int c){
int r=0,x=c;
for(int i=1;i<=n;i++){
if(v[i]>c){
return 999999;
}
if(x>=v[i]){
x-=v[i];
}
else{
x=c;
r++;
i--;
}
}
return r;
}
int main()
{
int k,s=0,pas=1<<30;
fin>>n>>k;
for(int i=1;i<=n;i++){
fin>>v[i];
}
while(pas!=0){
if(nt(s+pas)>=k){
s+=pas;
}
pas/=2;
}
fout<<s+1;
return 0;
}