Pagini recente » Cod sursa (job #790805) | Cod sursa (job #365772) | Cod sursa (job #242178) | Cod sursa (job #1436509) | Cod sursa (job #2715994)
#include <fstream>
using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
int a[16001];
int main()
{
int n, k, l=0, r=0, rez;
in>>n>>k;
for(int i=1;i<=n;i++)
{
in>>a[i];
if(a[i]>l)
r=a[i];
r+=a[i];
}
while(l<=r)
{
int mij=(l+r)/2;
int t=1, s=0;
for(int i=1;i<=n;i++)
{
s+=a[i];
if(s>mij)
{
t++;
s=a[i];
}
}
if(t>k)
l=mij+1;
else
{
r=mij-1;
rez=mij;
}
}
out<<rez;
return 0;
}