Pagini recente » Cod sursa (job #3159428) | Cod sursa (job #2755250) | Cod sursa (job #187998) | Cod sursa (job #2530361) | Cod sursa (job #2911173)
#include <fstream>
using namespace std;
ifstream fin("grupuri.in");
ofstream fout("grupuri.out");
int k, n, v[100001];
int test(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, sol=0;
int dr=100000000;
while(st<=dr)
{
int mid=(st+dr)/2;
if(test(mid))
{
st=mid+1;
sol=mid;
}
else
{
dr=mid-1;
}
}
fout<<dr;
return 0;
}