Pagini recente » Cod sursa (job #816979) | Cod sursa (job #2842270) | Cod sursa (job #960941) | Cod sursa (job #2858175) | Cod sursa (job #1310282)
#include<fstream>
#include<algorithm>
using namespace std;
ifstream cin("grupuri.in");
ofstream cout("grupuri.out");
const int N=100010;
int n,i,k,a[N];
long long sum,l,r,mij,sol;;
int f(long long x)
{
long long s=0;
for (i=1;i<=n;i++)s+=min(a[i],x);
return x*k<=s;
}
int main()
{
cin>>k>>n;
for (i=1;i<=n;i++)cin>>a[i],sum+=a[i];
l=0;r=sum/k;
while (l<=r)
{
mij=(l+r)/2;
if (f(mij)) sol=mij,l=mij+1;
else r=mij-1;
}
cout<<sol;
return 0;
}