Pagini recente » Cod sursa (job #1825656) | Cod sursa (job #2913616) | Cod sursa (job #896616) | Cod sursa (job #2154120) | Cod sursa (job #1501282)
#include<cstdio>
long long k,n,v[100001],i,j,l1,l2,mid,s,o;
int main ()
{
freopen("grupuri.in","r",stdin);
freopen("grupuri.out","w",stdout);
scanf("%lld%lld",&k,&n);
for(i=1;i<=n;i++)
{
scanf("%lld",&v[i]);
s+=v[i];
}
l2=s/k;
while(l1<=l2)
{
long long s1=0;
mid=(l1+l2)/2;
for(i=1;i<=n;i++)
{
if(mid>=v[i])
s1+=v[i];
else
s1+=mid;
}
if(s1/k>=mid)
{
o=mid;
l1=mid+1;
}
else
l2=mid-1;
}
printf("%lld",o);
return 0;
}