博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
Codeforces 758A Holiday Of Equality
阅读量:6236 次
发布时间:2019-06-22

本文共 3339 字,大约阅读时间需要 11 分钟。

题目链接:
A. 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 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.

 

题意:为了公平,最少需要多少福利,每个人都要最多的那个人手里的钱就OK了。

1 #include 
2 3 using namespace std; 4 5 const int maxn = 1000000 + 5; 6 7 int n; 8 int a[maxn]; 9 10 int main()11 {12 13 scanf("%d",&n);14 int mmax = -1;15 for(int i=0;i

 

A. 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 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.

转载于:https://www.cnblogs.com/TreeDream/p/6322650.html

你可能感兴趣的文章
多线程
查看>>
java socket
查看>>
得到一个临时的文件名称
查看>>
电路原理图
查看>>
几种白盒测试的实例
查看>>
数学分析_Tom Apostol_定理7.48:黎曼可积的充要条件
查看>>
《微分方程_附应用及历史注记》Page 4.
查看>>
TreeView的绑定与读取
查看>>
frame和bounds
查看>>
TFS简介
查看>>
获取当前页面URL与服务器响应
查看>>
单例模式(Singleton)
查看>>
奇妙JS代码系列(三)一道有趣的题(创建一个长度为x数组)
查看>>
适合最新版docker自定义启动配置
查看>>
邮件客户端导入邮件通讯录地址薄
查看>>
IOS Socket 02-Socket基础知识
查看>>
echarts gauge仪表盘设置
查看>>
Milk 结构体
查看>>
[LeetCode]Reorder List
查看>>
java中异常抛出后代码还会继续执行吗
查看>>