题目链接:http://codeforces.com/contest/758/problem/A
题意:有n个人,每个人有x元,现让你给每个人一些钱使得每个人的钱一样多,问你最少要给多少钱
解析:水题,很简单的贪心策略,把每个人加到最大值那么大就好了
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#include <map>
using namespace std;
const int maxn = 1e6+100;
const int inf = 0x7ffffff;
int main(void)
{
int n;
scanf("%d",&n);
int ans = 0,maxx = 0;
for(int i=0;i<n;i++)
{
int x;
scanf("%d",&x);
maxx = max(x,maxx);
ans += x;
}
ans = n*maxx-ans;
printf("%d\n",ans);
return 0;
}