Pagini recente » Cod sursa (job #1170889) | Cod sursa (job #2840228) | Cod sursa (job #1844083) | Cod sursa (job #1697306) | Cod sursa (job #1170398)
#include <fstream>
using namespace std;
#define NMax 16005
ifstream f("transport.in");
ofstream g("transport.out");
long long cap=(1LL<<62),step;
int n,k;
int v[NMax];
int verif(long long c)
{
long long val=0;
int nr=1;
for(int i=1;i<=n;i++)
{
if(v[i]>c) return 0;
if(val+v[i]<=c) val+=(long long)v[i];
else val=(long long)v[i],nr++;
}
if(nr>k) return 0;
return 1;
}
int main()
{
int i;
f>>n>>k;
for(i=1;i<=n;i++) f>>v[i];
for(step=cap;step;step>>=1) if( verif(cap-step) ) cap-=step;
g<<cap<<"\n";
f.close();
g.close();
return 0;
}