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;
}