Pagini recente » Cod sursa (job #1762901) | Cod sursa (job #1461538) | Cod sursa (job #1164146) | Cod sursa (job #2887791) | Cod sursa (job #1022593)
#include <fstream>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int n, k, v[16001], i, mx;
int cautbin(int v[], int n, int st, int dr, int k)
{
int m, s, t;
while(st<dr)
{
m=st+(dr-st)/2;
s=0;
t=1;
for(i=1; i<=n; i++)
{
if(s+v[i]<=m) s+=v[i];
else
{
t++;
s=v[i];
}
}
if(t>k) st=m+1;
else dr=m;
}
return st;
}
int main()
{
cin>>n>>k;
for(i=1; i<=n; i++)
{
cin>>v[i];
mx+=v[i];
}
cout<<cautbin(v, n, 1, mx, k);
return 0;
}