Pagini recente » Cod sursa (job #1876975) | Cod sursa (job #3174369) | Cod sursa (job #2561702) | Cod sursa (job #98201) | Cod sursa (job #3256973)
#include <fstream>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int n,i,k,mij,s,maxim;
int v[100000];
int main()
{
cin>>n>>k;
for(i=1;i<=n;i++)
{
cin>>v[i];
s+=v[i];
if(v[i]>maxim)
{
maxim=v[i];
}
}
int st=maxim;
int dr=s;
while(st<=dr)
{
mij=(st+dr)/2;
if(mij*k-s<mij && k*mij-s>=0)
{
break;
}
if(k*mij-s<0)
{
st=mij+1;
}
if(mij*k-s>=mij)
{
dr=mij-1;
}
}
cout<<mij;
return 0;
}