Pagini recente » Cod sursa (job #2607435) | Cod sursa (job #2167435) | Cod sursa (job #3165055) | Cod sursa (job #1197279) | Cod sursa (job #2328378)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n, k, a[16004], sum, maxi;
void Read()
{
fin >> n >> k;
for(int i=1; i<=n; i++)
fin >> a[i];
for(int i=1; i<=n; i++)
sum += a[i], maxi = max(a[i], maxi);
}
int Cautbin()
{
int mij, st, dr, nr, cnt,i, vol = 0;
st = 1;
dr = 16000;
while(st <= dr)
{
mij = (st + dr)/2;
if((mij*k)-sum >= 0) dr = mij - 1, vol = mij;
else st = mij + 1;
}
if(vol+1 < maxi) return maxi;
return vol+1;
}
int main()
{
Read();
fout << Cautbin();
return 0;
}