Pagini recente » Cod sursa (job #558515) | Cod sursa (job #7760) | Cod sursa (job #558521) | Cod sursa (job #1879050)
#include <fstream>
using namespace std;
const int NMAX=16005;
int v[NMAX];
int main()
{
ifstream fin ("transport.in");
ofstream fout ("transport.out");
int n,k,i,total=0,st=0,dr,med,last=0,s=0;
fin>>n>>k;
for(i=1; i<=n; i++)
{
fin>>v[i];
total=total+v[i];
}
dr=total;
while(st<=dr)
{
s=0;
med=(st+dr)/2;
int tr=0;
for(i=1; i<=n; i++)
{
if(v[i]>med)
{
tr=k+1;
break;
}
if(s+v[i]<=med)
s=s+v[i];
else
{
tr++;
s=v[i];
}
}//for
if(s<=med)
tr++;
if(tr<=k)
{
last=med;
dr=med-1;
}
else
st=med+1;
}//while
fout<<last;
fin.close();
fout.close();
return 0;
}