Cod sursa(job #180509)
Utilizator | Casu-Pop Bogdan bogdanhm999 | Data | 17 aprilie 2008 09:41:21 |
---|---|---|---|
Problema | Grupuri | Scor | 76 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <stdio.h>
long k,n,i,s,a[100005];
long solve(long n,long k){
if (k==1)return s;
if (a[n]<=s/k)return s/k;
else {s-=a[n];return solve(n-1,k-1);}
}
int main(){
freopen("grupuri.in","r",stdin);
freopen("grupuri.out","w",stdout);
scanf("%ld %ld",&k,&n);
for (i=1;i<=n;i++){
scanf("%ld",&a[i]);
s+=a[i];
}
if (a[n]<=s/k){printf("%ld\n",s/k);return 0;}
s-=a[n];
printf("%ld\n",solve(n-1,k-1));
return 0;
}