Cod sursa(job #1897692)
Utilizator | Data | 1 martie 2017 17:21:44 | |
---|---|---|---|
Problema | Grupuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <fstream>
#include <algorithm>
using namespace std;
const int NMAX = 100000 + 5;
const int VALMAX = 1000000 + 5;
typedef long long int lint;
int N, K;
int v[NMAX];
int main()
{
ifstream cin("grupuri.in");
ofstream cout("grupuri.out");
cin >> K >> N;
lint sum = 0;
for (int i = 1; i <= N; ++ i) {
cin >> v[i];
sum += v[i];
}
while (sum / K < v[N]) {
sum -= v[N --];
K --;
}
cout << sum / K << '\n';
return 0;
}