Pagini recente » Cod sursa (job #1231720) | Cod sursa (job #1913297) | Cod sursa (job #2895030) | Monitorul de evaluare | Cod sursa (job #2769808)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int main()
{
int n,k,V[16005],maxim,volum,sol,st,dr,mid;
fin>>n>>k;
maxim = -1;
volum = 0;
for(int i = 1;i<=n;i++)
{
fin>>V[i];
if(V[i]>maxim)
maxim = V[i];
volum = volum + V[i];
}
st = maxim;
dr = 16000;
while(st<=dr)
{
mid = (st+dr)/2;
if(volum/mid <= k)
{
sol = mid;
dr = mid-1;
}
else{
if(volum/mid > k)
st = mid+1;
}
}
fout<<sol;
}