Pagini recente » Cod sursa (job #2168822) | Cod sursa (job #3304306) | Cod sursa (job #1967960) | Cod sursa (job #3349766) | Cod sursa (job #3329584)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("grupuri.in");
ofstream fout("grupuri.out");
long long k,n,a[100005],i,sum,st,dr,mij,rez;
long long s;
int main()
{
fin>>k>>n;
for(i=1; i<=n; i++)
{
fin>>a[i];
sum=sum+a[i];
}
st=0;
dr=10000000;
while(st<=dr)
{
mij=(st+dr)/2;
for(i=1; i<=n; i++)
{
if(a[i]<mij)
s=s+a[i];
else
s=s+mij;
}
if(k*mij<=s)
{
rez=mij;
st=mij+1;
}
else
dr=mij-1;
s=0;
}
fout<<rez;
return 0;
}