Pagini recente » Cod sursa (job #258054) | Cod sursa (job #556152) | Cod sursa (job #2605590) | Cod sursa (job #523412) | Cod sursa (job #2480651)
#include <iostream>
#include <cstdio>
using namespace std;
int a[100001];
long long n,k,st,dr,mij,sum,rez,i;
int main()
{
freopen("grupuri.in","r",stdin);
freopen("grupuri.out","w",stdout);
cin>>k>>n;
for(i=1;i<=n;i++)
cin>>a[i];
st=1;
dr=100000000000;
while(st<=dr)
{
sum=0;
mij=(st+dr)/2;
for(i=1;i<=n;i++)
if(a[i]<mij)
sum+=a[i];
else
sum+=mij;
if(sum<k*mij)
dr=mij-1;
else
{
rez=mij;
st=mij+1;
}
}
cout<<rez;
return 0;
}