Cod sursa(job #1024457)
Utilizator | Data | 8 noiembrie 2013 18:31:08 | |
---|---|---|---|
Problema | Grupuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
#define nmax 100005
using namespace std;
ifstream in("grupuri.in");
ofstream out("grupuri.out");
long n, k, v[nmax];
long long s=0;
int main()
{
in >> k >> n;
for ( long i = 1; i <= n; ++i )
{
in >> v[i];
s += v[i];
}
for ( long i = n; i >= 1; --i )
if ( v[i] > s/k )
s -= v[i], --k;
else break;
out << s/k;
return 0;
}