Pagini recente » Cod sursa (job #469312) | Cod sursa (job #1586903) | Cod sursa (job #167182) | Cod sursa (job #475430) | Cod sursa (job #7654)
Cod sursa(job #7654)
#include <stdio.h>
#define MAX 100003
#include <math.h>
long n, k, a[MAX];
long long Solve(long n, long long sum, long k)
{
if (n < 0 || k <= 0) return 0;
if (a[n] <= sum / (long long)k) return sum / (long long)k;
return Solve(n-1, sum-a[n], k-1);
}
int main()
{
long i;
long long sum = 0;
freopen("grupuri.in", "r", stdin);
freopen("grupuri.out", "w", stdout);
scanf("%d %d", &k, &n);
for (i = 0; i < n; i++)
{
scanf("%d", &a[i]);
sum += (long long)a[i];
}
printf("%ld\n", Solve(n-1, sum, k));
return 0;
}