Pagini recente » Cod sursa (job #297406) | Cod sursa (job #2375126) | Cod sursa (job #818119) | Cod sursa (job #290507) | Cod sursa (job #2139467)
#include <fstream>
using namespace std;
long v[100001];
int main()
{ long st,dr,mij,k,sum=0,sol;
int n,i;
ifstream f("grupuri.in");
ofstream g("grupuri.out");
f>>k>>n;
for (i=1;i<=n;++i)
f>>v[i],sum+=v[i];
st=1,dr=sum/k;
sol=0;
while (st<=dr) {
mij=(st+dr)/2;
sum=0;
for (i=1;i<=n;++i)
sum+=min(mij,v[i]);
if (sum>=k*mij) sol=max(sol,mij),st=mij+1;
else dr=mij-1;
}
g<<sol;
return 0;
}