Pagini recente » Cod sursa (job #1370441) | Cod sursa (job #1669843) | Cod sursa (job #1660434) | Cod sursa (job #3326356) | Cod sursa (job #3359150)
#include <fstream>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int v[20001], mx, s, u, nr, k, mij, p, n, i, sol;
int main()
{
cin>>n>>k;
for(i=1;i<=n;i++)
{
cin>>v[i];
if(v[i]>mx)
mx=v[i];
s=s+v[i];
}
p=mx;
u=s;
while(p<=u)
{
mij=(p+u)/2;
nr=1;
s=0;
for(i=1;i<=n;i++)
{
s=s+v[i];
if(s>mij)
{
nr++;
s=v[i];
}
}
if(nr<=k)
{
sol=mij;
u=mij-1;
}
else p=mij+1;
}
cout<<sol;
return 0;
}