Pagini recente » Cod sursa (job #3293342) | Cod sursa (job #2719346) | Cod sursa (job #881355) | Cod sursa (job #1822277) | Cod sursa (job #2776689)
#include <fstream>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int v[16005],n,i,k,t,r,mid;
int verif(int v[],int n,int suma)
{
int i,p=1,s=0;
for(i=1; i<=n; ++i)
{
s+=v[i];
if(s>suma)
{
p++;
s=v[i];
}
}
if(p<=k) return 1;
else return 0;
}
int main()
{
cin>>n>>k;
for(i=1; i<=n; ++i)
{
cin>>v[i];
t+=v[i];
}
int st=1,dr=t;
while(st<=dr)
{
mid=(st+dr)/2;
if(verif(v,n,mid))
{
r=mid;
dr=mid-1;
}
else st=mid+1;
}
cout<<r;
return 0;
}