Pagini recente » Cod sursa (job #963317) | Cod sursa (job #802194) | Cod sursa (job #2320758) | Cod sursa (job #2919657) | Cod sursa (job #2528711)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int a[100004],n,k;
int Test(int C)
{
///daca pot impartii vectorul in cel mult k
///secv,fiecare secv ,avand suma <=C
int i,s=0,cnt=1;
for(i=1;i<=n;i++)
{
if(a[i]>C)return 0;
if(s+a[i]<=C)s+=a[i];
else
{
cnt++;
s=a[i];
}
}
return (cnt<=k);
}
int CB()
{
int st,dr,p,mijl;
st=1;dr=256000000;p=1;
while(st<=dr)
{
mijl=(st+dr)/2;
if(Test(mijl)==1)
{
p=mijl;
dr=mijl-1;
}
else st=mijl+1;
}
return p;
}
int main()
{
int i;
fin>>n>>k;
for(i=1;i<=n;i++)
fin>>a[i];
fout<<CB();
return 0;
}