通过代码:
#include <bits/stdc++.h> #define LL long long using namespace std; LL n, a[101], maxn, maxp, sum; int main() { scanf("%lld", &n); for(LL i = 1; i <= n; i ++) { scanf("%lld", &a[i]); sum += a[i]; maxn = max(maxn, a[i]); } for(LL i = 1; i <= n; i ++) if(a[i] == maxn) maxp ++; printf("%lld", sum - maxn * maxp); return 0; }
1113:不与最大数相同的数字之和
最新推荐文章于 2024-01-24 11:31:06 发布