Pagini recente » Cod sursa (job #1798312) | Cod sursa (job #2768551) | Cod sursa (job #1141787) | Cod sursa (job #2865527) | Cod sursa (job #2333278)
#include <fstream>
using namespace std;
ifstream cin ("grupuri.in");
ofstream cout ("grupuri.out");
long long v[100005];
int main()
{
long long n,k,i,st=1,dr=0,s=0,m,x=0;
cin>>k>>n;
for (i=1;i<=n;i++)
{
cin>>v[i];
dr+=v[i];
}
//dr=s;
while (st<=dr)
{
m=(st+dr)/2;
s=0;
for (i=1;i<=n;i++)
s+=min(v[i],m);
if (s>=m*k)
{
x=m;
st=m+1;
}
else
dr=m-1;
}
cout<<x;
return 0;
}