Pagini recente » Cod sursa (job #352485) | Cod sursa (job #2048424) | Cod sursa (job #167766) | Cod sursa (job #1041889) | Cod sursa (job #1740849)
#include<iostream>
#include<fstream>
using namespace std;
long long a[100003],i,n,m,k,l1,l2,sol;
int main()
{
ifstream cin("grupuri.in");
ofstream cout("grupuri.out");
cin>>k>>n;
for(i=1;i<=n;i++)
{
cin>>a[i];
l2+=a[i];
}
l1=0;
while(l1<=l2)
{
long long mid=(l1+l2)/2;
long long sum=0;
for(i=1;i<=n;i++)
sum+=min(mid,a[i]);
if(sum>=mid*k)
{
sol=mid;
l1=mid+1;
}
else
{
l2=mid-1;
}
}
cout<<sol;
return 0;
}