Pagini recente » Cod sursa (job #463323) | Cod sursa (job #1271388) | Cod sursa (job #1185389) | Cod sursa (job #1546025) | Cod sursa (job #1501299)
#include<cstdio>
using namespace std;
int main(){
int i,n,k,m,dr,st,a[1000000],c,su,nranim=0,s=0;
freopen("grupuri.in","r",stdin);
freopen("grupuri.out","w",stdout);
scanf("%d %d", &k &n);
for(i=1;i<=n;i++)
{
scanf("%d", &a[i]);
nranim+=a[i];}
st=1;
dr=nranim/k;
m=dr/2;
while(st<=dr)
{
m=(st+dr)/2;
for(i=1;i=n;i++)
{
if(v[i]>=m)
su+=m;
else
su+=v[i];
if(su/k>=m)
{
st=m+1;
c=m;
}
else
dr=m+1;
}
}
print("%d", c);
return 0;
}