Pagini recente » Cod sursa (job #192567) | Cod sursa (job #1616418) | Cod sursa (job #1275306) | Cod sursa (job #3291305) | Cod sursa (job #2663574)
#include <fstream>
#define N 16010
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
long long n, k, a[N];
bool verific(int c)
{
long long tr, s, i;
s=0;
tr=0;
for(i=1;i<=n;i++)
{
if (a[i]>c)
return 0;
if(s+a[i]<=c)
{
s=s+a[i];
}
else
{
tr++;
s=a[i];
}
}
if(s>0)
tr++;
return tr<=k;
}
int CautareBinara(int st, int dr)
{
long long mij, ultim = -1;
while(st<=dr)
{
mij=(st+dr)/2;
if(verific(mij))
{
ultim=mij;
dr=mij-1;
}
else
st=mij+1;
}
return ultim;
}
int main()
{
long long i, s=0;
fin >> n >> k;
for(i=1; i<=n; i++)
fin>>a[i];
for(i=1; i<=n; i++)
s=s+a[i];
fout<< CautareBinara(1, s);
return 0;
}