Pagini recente » Cod sursa (job #409065) | Cod sursa (job #1408413) | Cod sursa (job #1940055) | Cod sursa (job #1315889) | Cod sursa (job #2911174)
#include <fstream>
using namespace std;
ifstream fin("grupuri.in");
ofstream fout("grupuri.out");
long long int k, n, v[100001];
int test(long long int x)
{
long long s=0;
for(int i=1; i<=n; i++)
{
s+=min(x, v[i]);
}
if(s>=x*k*1LL)
{
return 1;
}
return 0;
}
int main()
{
fin>>k>>n;
for(int i=1; i<=n; i++)
{
fin>>v[i];
}
int st=0;
int dr=100000000;
while(st<=dr)
{
int mid=(st+dr)/2;
if(test(mid))
{
st=mid+1;
}
else
{
dr=mid-1;
}
}
fout<<dr;
return 0;
}