Cod sursa(job #529314)
Utilizator | Data | 4 februarie 2011 18:27:38 | |
---|---|---|---|
Problema | Grupuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include<stdio.h>
FILE*fin,*fout;
long long v[100001],n,k,a,i,j,s,u,p,max,m;
int main(){
fin=fopen("grupuri.in","r");
fout=fopen("grupuri.out","w");
fscanf(fin,"%lld %lld",&k,&n);
for(i=1;i<=n;i++){
fscanf(fin,"%lld",&v[i]);
s=s+v[i];
}
p=1;u=s/k;
while(p<=u){
m=(u+p)/2;
s=0;
for(i=1;i<=n;i++){
if(v[i]>m){s=s+m;}
else{s=s+v[i];}
}
if(m*k>s){
u=m-1;
}
else{
if(m>max){max=m;}
p=m+1;
}
}
fprintf(fout,"%lld",max);
return 0;}