Pagini recente » Borderou de evaluare (job #3367838) | Borderou de evaluare (job #3367851) | Cod sursa (job #3364677) | Cod sursa (job #3367728) | Cod sursa (job #3365825)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("transport.in");
ofstream fout ("transport.out");
int n, k, i;
long long x, sum, mic;
vector<int> nr;
int main()
{
fin >> n >> k ;
long long st=0;
for(i=1;i<=n;i++)
{
fin >> x ;
nr.push_back(x);
sum+=x;
if(x>st)
st=x;
}
long long dr=sum,mij;
while(st<=dr)
{
mij=(st+dr)/2;
int tr=1;
long long s=0;
for(i=0;i<n;i++)
{
if(s+nr[i]<=mij)
s+=nr[i];
else
{
s=nr[i];
tr++;
}
}
if(tr>k)
st=mij+1;
else
{
mic=mij;
dr=mij-1;
}
}
fout << mic;
return 0;
}