Pagini recente » Cod sursa (job #3140461) | Cod sursa (job #947204) | Cod sursa (job #627254) | Cod sursa (job #1197547) | Cod sursa (job #2794758)
#include <fstream>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int n,k,ma,v[16005],i,j,p,u,mij,sol,t;
int q(int k)
{
int nr=1,s=0;
for(i=1;i<=n;i++)
{
s=s+v[i];
if(s>k) {s=v[i];nr++;}
}
return nr;
}
int main()
{
cin>>n>>k;
for(i=1;i<=n;i++)
{
cin>>v[i];
if (v[i]>ma) ma=v[i];
}
p=ma;
u=256000000;
sol=0;
while(p<=u)
{
mij=(p+u)/2;
t=q(mij);
if(t<=k) {sol=mij;u=mij-1;}
else p=mij+1;
}
cout<<sol<<'\n';
return 0;
}