Pagini recente » Cod sursa (job #2763997) | Cod sursa (job #2757205) | Cod sursa (job #3295496) | Cod sursa (job #3295491)
#include <fstream>
using namespace std;
ifstream cin ("transport.in");
ofstream cout ("transport.out");
int v[16001];
int main()
{
int n, k, i, s=0, vol, maxi=0, mij, s2=0, cnt=0;
cin>>n>>k;
for(i=1; i<=n; i++)
{
cin>>v[i];
if(v[i]>maxi)
maxi=v[i];
s2=s2+v[i];
}
int st=maxi;
int dr=s2;
int sol=-1;
while(st<=dr)
{
mij=(st+dr)/2;
cnt=1;
for(i=1; i<=n; i++)
{
if(s+v[i]<=mij)
s=s+v[i];
else
{
s=v[i];
cnt++;
}
}
if (cnt>k)
st=st+1;
else
{
sol=mij;
dr=mij-1;
} }
cout<<sol;
return 0;
}