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

来源:互联网 发布:type c耳机推荐 知乎 编辑:程序博客网 时间:2024/06/05 17:53

所有数与数中最大值之差的和

#include <iostream>#include <stdio.h>#include <algorithm>#include <string.h>using namespace std;const int MAX = 100+10;int n,  a[MAX], maxx;int main(){    maxx = -1;    scanf("%d", &n);    for(int i = 0; i<n; ++i)    {        scanf("%d", &a[i]);        if(a[i]>maxx)maxx = a[i];    }    long long ans = 0;    for(int i = 0; i<n; ++i)        if(a[i]!=maxx)ans+=(maxx-a[i]);    cout<<ans<<endl;    return 0;}

0 0
原创粉丝点击