Pagini recente » Cod sursa (job #784870) | Cod sursa (job #1852595) | Cod sursa (job #2230633) | Cod sursa (job #2040350) | Cod sursa (job #390746)
Cod sursa(job #390746)
#include <iostream>
#include <cstdio>
#define NMAX 100005
using namespace std;
long N, K, sum;
long A[NMAX];
void rez1(void)
{
//12 pct;
for(long i = 1; i <= N; ++i)
scanf("%d", &A[i]), sum += A[i];
printf("%d", sum / K);
}
long rez2(long N, long sum, long K)
{
if(N < 1 || K < 1)
return 0;
if(A[N] <= sum / K)
return sum / K;
return rez2(N - 1, sum - A[N], K - 1);
}
int main(void)
{
freopen("grupuri.in", "r", stdin);
freopen("grupuri.out", "w", stdout);
scanf("%d%d", &K, &N);
for(long i = 1; i <= N; ++i)
scanf("%d", &A[i]), sum += A[i];
printf("%d", rez2(N, sum, K));
return 0;
}