Pagini recente » Cod sursa (job #533222) | Cod sursa (job #354622) | Cod sursa (job #2461166) | Cod sursa (job #1100264) | Cod sursa (job #1024275)
#include <cstdio>
int v[100001];
int k, n;
int valid(int x)
{
int i;
long long s = 0;
for(i=1; i<=n; i++)
s += (v[i] < x)? v[i]:x;
if((long long) k*x <= s)
return 0;
return 1;
}
int main ()
{
freopen("grupuri.in", "r", stdin);
freopen("grupuri.out", "w", stdout);
scanf("%d%d", &k, &n);
for(int i=1; i<=n; i++)
scanf("%d", &v[i]);
int i, pas = 1<<30;
for(i = 0; pas; pas >>= 1)
if(valid(i+pas) == 0)
i += pas;
printf("%d\n", i);
return 0;
}