问题七十:Box of Bricks (ACM) (二)

2014-11-23 22:25:49 · 作者: · 浏览: 18
{
sum+=a[i]; //总数
}
average=sum/n;

for(i=0; i {
if(a[i]>average)
{
num=num+a[i]-average;
}
}

printf("Set #%d\n", j);
printf("The minimum number of moves is %d.\n\n", num);

j++;
}

return 0;
}

\