Pagini recente » Cod sursa (job #2604596) | Cod sursa (job #300218) | Cod sursa (job #1126996) | Cod sursa (job #373741) | Cod sursa (job #2831721)
#include <fstream>
#include <vector>
using namespace std;
long long a[16001];int n;
long long caut(long long st,long long dr,int k)
{
long long rez=1;
while(st<=dr)
{
long long m=(st+dr)/2;
int x=1;
long long s=0;
for(int i=0;i<n;i++)
{
if(s+a[i]>m)
{
x++;
s=a[i];
}
else
{
s+=a[i];
}
}
if(x<=k)
{
dr=m-1;
rez=m;
}
else
{
st=m+1;
}
}
return rez;
}
ifstream fin("transport.in");
ofstream fout("transport.out");
int main()
{
int k;
long long s=0,maxx=0;
fin>>n>>k;
for(int i=0;i<n;i++)
{
fin>>a[i];
s+=a[i];
maxx=max(maxx,a[i]);
}
fout<<caut(maxx,s,k);
}