Pagini recente » Cod sursa (job #1541487) | Cod sursa (job #214723) | Cod sursa (job #196931) | Cod sursa (job #1926149) | Cod sursa (job #343601)
Cod sursa(job #343601)
#include <stdio.h>
FILE *f,*s;
long long int n,k,i,sum,rez,v[100005];
long long int cautBin()
{
long long int st=1;
long long int dr=sum/k+sum%k;
long long int max=0;
while(st<=dr)
{
int mj=(st+dr)/2;
long long int x=0;
for(i=1;i<=n;i++)
{
if( v[i]>=mj && x+mj<=k*mj )
x+=mj;
else if( v[i]<mj && x+v[i]<=k*mj )
x+=v[i];
else
break;
}
if(x==k*mj&&mj>max)
max=mj;
if(x<mj*k)
dr=mj-1;
if(x<=mj*k)
st=mj+1;
}
return max;
}
int main()
{
f=fopen("grupuri.in","r");
s=fopen("grupuri.out","w");
fscanf(f,"%lld %lld",&k,&n);
for(i=1;i<=n;i++)
{
fscanf(f,"%lld",&v[i]);
sum+=v[i];
}
rez=cautBin();
fprintf(s,"%lld\n",rez);
fclose(s);
return 0;
}