Holiday Of Equality

最新推荐文章于 2020-07-31 20:43:03 发布

原创最新推荐文章于 2020-07-31 20:43:03 发布 · 328 阅读

0 ·

CC 4.0 BY-SA版权

为庆祝Berland的平等日假期，国王决定通过国家金库支出使所有公民的福利达到一致水平。作为皇家财务官，你需要计算实现这一目标所需的最小金额。此问题可通过寻找每个公民福利的最大值，并计算将所有较低福利提升至该最大值所需的总费用来解决。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Description：

In Berland it is the holiday of equality. In honor of the holiday the king decided to equalize the welfare of all citizens in Berland by the expense of the state treasury.

Totally in Berland there are n citizens, the welfare of each of them is estimated as the integer in ai burles (burle is the currency in Berland).

You are the royal treasurer, which needs to count the minimum charges of the kingdom on the king's present. The king can only give money, he hasn't a power to take away them.

Input：

The first line contains the integer n (1 ≤ n ≤ 100) — the number of citizens in the kingdom.

The second line contains n integers a1, a2, ..., an, where ai (0 ≤ ai ≤ 106) — the welfare of the i-th citizen.

Output：

In the only line print the integer S — the minimum number of burles which are had to spend.

题意：找出每组数最大的那个数，把剩下的几个数补到和最大那个数相等为止，水题！

AC代码：

#include<iostream>
using namespace std;
int main()
{

long n,i,max,s,a[101];
cin>>n;
for(i=1;i<=n;i++) cin>>a[i];
max=0;
for(i=1;i<=n;i++) if(a[i]>=max) max=a[i];
s=0;
for(i=1;i<=n;i++) s+=max-a[i];
cout<<s<<endl;
return 0;
}