Pagini recente » Istoria paginii utilizator/dacic_frumushic | Profil karastupid76 | bob | Istoria paginii utilizator/kitkat007 | Cod sursa (job #1900340)
#include <fstream>
using namespace std;
ifstream fin("grupuri.in"); ofstream fout ("grupuri.out");
const int nmax = 1e6;
int v[nmax + 1];
int main() {
int n, k;
long long s;
fin >> k >> n;
s = 0;
for (int i = 1; i <= n; ++ i) {
fin >> v[ i ];
s += v[ i ];
}
int ind = n;
while (ind > 0 && k > 0 && s / k <= v[ ind ]) {
-- k;
s -= v[ ind ];
-- ind;
}
if (ind == 0 || k == 0) {
fout << n << "\n";
} else {
fout << s / k << "\n";
}
fin.close();
fout.close();
return 0;
}