Pagini recente » Cod sursa (job #4127) | Borderou de evaluare (job #2247462) | Cod sursa (job #1146788) | Cod sursa (job #3270888) | Cod sursa (job #499978)
Cod sursa(job #499978)
#include<stdio.h>
FILE*f=fopen("grupuri.in","r");
FILE*g=fopen("grupuri.out","w");
int i,j,v[100001],p,u,n,k;
long long s,x,y;
int min(int a,int b){
if(a>b)
return b;
else
return a;
}
int main(){
fscanf(f,"%d%d",&k,&n);
for(i=1;i<=n;i++){
fscanf(f,"%d",&v[i]);
s+=v[i];
}
p=1;
u=s;
while(p<=u){
x=(p+u)/2;
s=0;
for(i=1;i<=n;i++)
s+=min(v[i],x);
if(s<x*k)
u=x-1;
else
if(s>x*k)
p=x+1;
else
break;
}
fprintf(g,"%d",x);
fclose(g);
fclose(f);
return 0;
}