Pagini recente » Cod sursa (job #1901246) | Cod sursa (job #1488167) | Cod sursa (job #698434) | Cod sursa (job #1560195) | Cod sursa (job #490139)
Cod sursa(job #490139)
#include<cstdio>
long long n,k,a[1<<20];
void read()
{
freopen("grupuri.in","r",stdin);
freopen("grupuri.out","w",stdout);
scanf("%lld%lld",&k,&n);
for(int i=1;i<=n;i++)
scanf("%lld",&a[i]);
}
long long min(long long x,long long y)
{
return x<y?x:y;
}
bool posibil(long long nrg)
{
long long el=0;
for(int i=1;i<=n;i++)
el+=min(a[i],nrg);
if(el>=(long long)k*nrg)
return true;
return false;
}
long long cautb()
{
long long pas=1,i=0;
for(int j=1;j<=40;j++)
pas*=(long long)2;
for(i=0;pas;pas>>=1)
if(posibil(i+pas))
i+=pas;
return i;
}
int main()
{
read();
printf("%lld",cautb());
return 0;
}