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
- CF-Codeforces Round #392 (Div. 2)-A-Holiday Of Equality
- Codeforces Round #392 (Div. 2) A.Holiday Of Equality
- Codeforces Round #392(Div. 2) A Holiday Of Equality【水题】
- Codeforces Round #392 (Div. 2)A Holiday Of Equality
- Codeforces Round #392 (Div. 2)Holiday Of Equality
- Codeforces Round #392 (Div. 2) 758A Holiday Of Equality
- Codeforces Round #392 (Div. 2) A. Holiday Of Equality(水题)
- 【codeforces 758A】Holiday Of Equality
- Codeforces 758A-Holiday Of Equality
- CodeForces 758A Holiday Of Equality
- Holiday Of Equality (Codeforces-758A)
- Codeforces758A Holiday Of Equality
- A. Holiday Of Equality
- CF758 A. Holiday Of Equality (水题)
- Codeforces Round #392 (Div. 2)
- Codeforces Round #392 (Div. 2)
- Codeforces Round #392 (Div. 2)
- Codeforces Round #188 (Div. 2) B. Strings of Power
- DIY个人智能家庭网关—— 路由器篇之安装python
- 10005---maybe, perhaps, probably, possibly辨析
- HDU2141:Can you find it?(二分 + 优化)
- 欢迎使用CSDN-markdown编辑器
- Hadoop----集群搭建指南(上卷)
- Codeforces Round #392 (Div. 2)Holiday Of Equality
- github入门
- Codeforces Round #392 (Div. 2)Blown Garland
- Spring入门学习(二)RESTful风格的Controller
- 【C语言函数库】C语言中的ctype.h.库常用函数
- App前端,Web前端,后端,微信小程序到底该学啥?
- VMware虚拟机三种联网方法及原理
- P1004 方格取数
- org.hibernate.LazyInitializationException: could not initialize proxy - no Session