Cod sursa(job #954735)
Utilizator | Data | 29 mai 2013 22:38:28 | |
---|---|---|---|
Problema | Grupuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("grupuri.in");
ofstream g("grupuri.out");
long long n,s,i,x,k,v[1000000];
int main()
{
f>>k>>n;
for (i=1;i<=n;i++)
{
f>>x;
v[i]=v[i-1]+x;
}
while (v[n]-v[n-1]>v[n]/k)
{
--n;
--k;
}
g<<v[n]/k;
f.close();
g.close();
}