A. Holiday Of Equality

传送门

758A. Holiday Of Equality

time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

题目描述
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 a i 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 a 1, a 2, …, a n, where a i (0 ≤ a i ≤ 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.

题意：在一个讲求平等的节日，每个公民都有自己的福利值，国家要求发放福利使每个公平的福利都相等，求发放最少的福利数量。

思路：输入每个公民的福利时，先找出单个公民福利的最大值，因为必须以最大值为平等的福利值，后统计所有公民的总福利，最后计算每个公民达到最大值的总福利与之前统计的总福利之差即可。

代码

#include<iostream>
using namespace std;
int main()
{
	int n,sum= 0,m;
	cin >> n;
	int maxn = 0;
	for(int i = 0;i<n;i++)
	{
		cin >> m;
		maxn = max(m,maxn);
		sum+= m;
	}
	cout << n*maxn - sum <<endl;
	return 0;
 }