Pagini recente » Cod sursa (job #1588667) | Cod sursa (job #2911521) | Cod sursa (job #3195584) | Cod sursa (job #978914) | Cod sursa (job #2495173)
#include <bits/stdc++.h>
using namespace std;
ifstream f("grupuri.in");
ofstream g("grupuri.out");
int k, n;
int rez, sus, x[100005];
void solve(int n, int k)
{
if (n<0 || rez<0)
{
g << 0;
return;
}
if (x[n]<=rez/k)
{
g << rez/k;
return;
}
rez-=x[n];
solve(n-1,k-1);
}
int main( )
{
f >> k >> n;
for (int i=1; i<=n; ++i)
{
f >> x[i];
rez+=x[i];
}
solve(n,k);
return 0;
}