Holiday Of Equality
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.
Examples
Input
5 0 1 2 3 4
Output
10
Input
5 1 1 0 1 1
Output
1
Input
3 1 3 1
Output
4
Input
1 12
Output
0
Note
In the first example if we add to the first citizen 4 burles, to the second 3, to the third 2 and to the fourth 1, then the welfare of all citizens will equal 4.
In the second example it is enough to give one burle to the third citizen.
In the third example it is necessary to give two burles to the first and the third citizens to make the welfare of citizens equal 3.
In the fourth example it is possible to give nothing to everyone because all citizens have 12 burles.
中文版题目:
在Berland,这是平等的假期。为了纪念这个节日,国王决定通过国库的费用来平衡伯兰地所有公民的福利。在Berland完全有n个公民,他们每个人的福利估计为ai burles中的整数(burle是Berland的货币)。你是皇家财务主管,需要在国王的礼物上计算王国的最低费用。国王只能给钱,他没有权力拿走他们。输入第一行包含整数n(1≤n≤100) - 王国中的公民人数。第二行包含n个整数a1,a2,...,an,其中ai(0≤ai≤106) - 第i个公民的福利。输出在唯一的行中打印整数S - 必须花费的最小burles数。示例输入5 0 1 2 3 4输出10输入5 1 1 0 1 1输出1输入3 1 3 1输出4输入1 12输出0注意在第一个示例中,如果我们添加到第一个公民4个burles,到第二个3到第三个2和第四个1,那么所有公民的福利将等于4.在第二个例子中,给第三个公民一个人就足够了。在第三个例子中,有必要给第一和第三公民两个角色,使公民的福利等于3.在第四个例子中,可以不给每个人任何东西,因为所有公民都有12个角色。
题意:
这道题实际上就是原来这个国家的人手里都有一定的钱,但是到这个节日的时候,国王想要分配的更加的合理,所以给他们加钱使得每个人的受伤的前都是相等的,问你国王一共要加多少钱。
思路:
首先,要输入所有人手上的金钱数量,然后先进行排序,每个人都跟最大的那个人相减,然后求一下和即可
AC代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
using namespace std;
int a[110];//定义一个数组存放数据
int main()
{
int n;//输入有多少个数字
int maxn=0;
int sum=0;
while(~scanf("%d",&n))//输入有n个数字
{
sum=0;
maxn=0;
memset(a,0,sizeof(a));//数组初始化
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
sort(a,a+n);//排序
for(int i=0;i<n;i++)
{
sum=sum+(a[n-1]-a[i]);
}
printf("%d\n",sum);
}
return 0;
}