Pagini recente » Cod sursa (job #514466) | Cod sursa (job #3144940) | Cod sursa (job #2563591) | Cod sursa (job #1837010) | Cod sursa (job #2417177)
#include <iostream>
#include <cstdio>
using namespace std;
int n,k;
long long a[100005];
bool ok(long long val){
long long s = 0;
for(int i = 0; i < n; ++i)
s+=min(a[i],val);
if(s>val*k)
return 1;
return 0;
}
int main()
{
freopen("grupuri.in","r",stdin);
freopen("grupuri.out","w",stdout);
scanf("%d%d", &k,&n);
for(int i = 0; i < n; ++i)
scanf("%d", &a[i]);
long long st = 1, dr = 100000000000, mij;
while(st<dr){
mij = (st+dr)/2;
if(!ok(mij))
dr=mij;
else
st = mij + 1;
}
cout<<st;
return 0;
}