Cod sursa(job #1905897)
Utilizator | Data | 6 martie 2017 11:32:33 | |
---|---|---|---|
Problema | Grupuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
# include <bits/stdc++.h>
using namespace std;
const int Nmax = 100000 + 5;
long long k, n, x, S, v[Nmax];
int main ()
{
freopen("grupuri.in", "r", stdin);
freopen("grupuri.out", "w", stdout);
scanf("%lld %lld\n", &k, &n);
for (int i = 1; i <= n; ++i) {
scanf("%lld ", &v[i]);
S += v[i];
}
while (S / k < v[n])
S -= v[n], --n, --k;
printf("%lld\n", S / k);
return 0;
}