Pagini recente » Cod sursa (job #301649) | Cod sursa (job #2626145) | Cod sursa (job #469511) | Cod sursa (job #706910) | Cod sursa (job #1645735)
#include <fstream>
using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
const int NMax=16005;
int n, V[NMax], k, sol, maxim;
void Read()
{
in>>n>>k;
for(int i=0; i<n; i++)
{
in>>V[i];
maxim = max(maxim,V[i]);
}
}
bool ok(int m)
{
int contor=1, suma=0;
for(int i=0; i<n; i++)
{
suma += V[i];
if(suma > m) contor++, suma=V[i];
}
if(k>=contor) return 1;
else return 0;
}
void Solve()
{
int st, dr, mij;
st=maxim; dr=16000*16000;
while(st <= dr)
{
mij = (st+dr)/2;
if(ok(mij))
{
sol=mij;
dr=mij-1;
}
else st=mij+1;
}
}
void Print()
{
out<<sol;
}
int main()
{
Read();
Solve();
Print();
return 0;
}