CF-Codeforces Round #392 (Div. 2)-A-Holiday Of Equality

ACM模版

描述

题解

第二次打 CF，第一题极其简单，只要看样例就能看懂，补差价的问题。

代码

#include <iostream>using namespace std;const int MAXN = 101;int A[MAXN];int main(int argc, const char * argv[]){    int n;    cin >> n;    int mx = 0;    int sum = 0;    for (int i = 0; i < n; i++)    {        scanf("%d", A + i);        mx = max(mx, A[i]);        sum += A[i];    }    printf("%d\n", mx * n - sum);    return 0;}