Pagini recente » Cod sursa (job #3325124) | Cod sursa (job #2223986) | Cod sursa (job #2871895) | Cod sursa (job #964497) | Cod sursa (job #2342279)
#include <bits/stdc++.h>
using namespace std;
ifstream in("grupuri.in");
ofstream out("grupuri.out");
int a[100001];
int main()
{
int k, n, gmax = 0;
in>>k>>n;
for(int i = 1; i<=n; i++)
{
in>>a[i];
}
int st = 1, dr = n, m, s;
while(st<=dr)
{
m = (st+dr)/2;
s = 0;
for(int i = 1; i<=n; i++)
{
if(a[i]<=k)
s+=a[i];
else s+=k;
}
if(s/k>gmax)
{
gmax = s/k;
dr = m - 1;
}
else
st = m + 1;
}
out<<gmax;
return 0;
}