答案

#include <bits/stdc++.h>
using namespace std;
int a[110],sum=0;
int main(){
	int n;
	cin >> n;
	for(int i=1;i<=n;i++){
		cin >> a[i];
	}
	int max=a[1];
	for(int i=1;i<=n;i++){
		if(a[i]>=max){
			max=a[i];
		}
	}
	for(int i=1;i<=n;i++){
		if(a[i]==max){
			continue;
		}
		sum+=a[i];
	}
	cout << sum;
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main() {
    int N;
    cin >> N;
    vector<int> numbers(N);
    for (int i = 0; i < N; ++i) {
        cin >> numbers[i];
    }
    int n = *max_element(numbers.begin(), numbers.end());
    long long sum = 0;
    for (int number : numbers) {
        sum += number;
    }
    long long a = sum - n;
    cout << a << endl;
    return 0;
}