BNU Box of Bricks
2013-08-18 19:50
417 查看
http://www.bnuoj.com/bnuoj/problem_show.php?pid=1596
这个题一开始以为要求最少移动次数，把我吓到了，原来只要求最少移动几个方块就行了。。这一下就变简单很多了。。AC代码：
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
bool cmp(int a, int b)
{
return a<b;
}
int main()
{
int n,i,k,sum,p;
int a[55];
k = 0;
while(scanf("%d",&n)&&n)
{
k++;
sum = 0;
for(i = 0; i < n; i++)
{
scanf("%d",&a[i]);
sum += a[i];
}
sum = sum/n;
sort(a,a+n,cmp);
p = 0;
for(i = 0; i < n; i++)
{
if(a[i] < sum)
{
p+=(sum-a[i]);
}
else
{
break;
}
}
printf("Set #%d\n",k);
printf("The minimum number of moves is %d.\n\n",p);
}
return 0;
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- BNU Box of Bricks
- POJ 1477 Box of Bricks
- H - Box of Bricks
- POJ 1477 && HDU 1326 Box of Bricks（水~）
- Box of Bricks
- UVA 591 Box of Bricks
- HDU1326 Box of Bricks
- ZOJ_1251_Box of Bricks
- poj1477 box of bricks
- HDU 1326 Box of Bricks
- //水题五道//Fibbonacci Number//A1 = ?//Box of Bricks//Max Num//A|B?
- poj 1477 Box of Bricks
- pku 1477 Box of Bricks
- HDU Box of Bricks
- ZOJ Problem Set - 1251 Box of Bricks
- (贪心5.2.8)POJ 1477 Box of Bricks
- 591 - Box of Bricks
- hdu2088 Box of Bricks（C语言）
- Box of Bricks
- Box of Bricks（南阳oj）