zoj 1251 Box of Bricks

最新推荐文章于 2015-10-07 18:48:00 发布

yzl_rex

最新推荐文章于 2015-10-07 18:48:00 发布

阅读量453

点赞数

分类专栏： ZOJ 文章标签： include

本文链接：https://blog.csdn.net/yzl_rex/article/details/7364417

版权

ZOJ 专栏收录该内容

137 篇文章 0 订阅

订阅专栏

#include "iostream"
using namespace std;

int bricks[60];

int main()
{
    int num, i, sum, average, count, n = 0;
    while (cin >> num && num)
    {
          sum = average = count = 0;
          n++;
          for (i = 0; i < num; i++)
          cin >> bricks[i];
          for (i = 0; i < num; i++)
          sum += bricks[i];
          average = sum / num;
          for (i = 0; i < num; i++)
          {
              if (bricks[i] > average)
              count += bricks[i] - average;
          }
          cout << "Set #" << n << endl;
          cout << "The minimum number of moves is " << count << "."<< endl;
          cout << endl;
    }
}