yasuo👀️

#include <iostream>
#include <algorithm>
int main(){
    int q,a[105],sum=0;std::cin>>q;
    for(int i=0;i<q;i++) std::cin>>a[i];
    std::sort(a,a+q);
    for(int i=0;i<q-1;i++) sum+=a[i];
    std::cout<<sum;return 0;}

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