#include <iostream>
using namespace std;
int n,maxx = -1000001,a[100],sum;
int main()
{
    cin >> n;
    for (int i = 0;i < n;i++)
    {
        cin >> a[i];
        if (a[i] > maxx)
            maxx = a[i];
    }
    for (int i = 0;i < n;i++)
    {
        if (a[i] != maxx)
            sum += a[i];
    }
    cout << sum;
    return 0;
}

#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
	int a[1005],n,ans=0,sum=-9999999999;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		sum=max(a[i],sum);
		ans+=a[i];
	}
	for(int i=1;i<=n;i++){
		if(a[i]==sum)
			ans-=sum;
	}
	cout<<ans;
}

#include <iostream>
#include <stack>
#include <cmath>
#include <vector>
#include <string.h>
#include <queue>
#include <stdio.h>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#define int long long
using namespace std;
const int N = 1e2 + 10;
const int INF = 0x3f3f3f3f;
int a[N];
signed main()
{
	int n, maxn = -INF, ans = 0;
	cin >> n;
	for(int i = 1; i <= n; i++)
	{
		cin >> a[i];
		maxn = max(maxn, a[i]);
		ans += a[i];
	}
	for(int i = 1; i <= n; i++)
	{
		if(a[i] == maxn)
		{
			ans -= maxn;
		}
	}
	cout << ans << endl;
	return 0;
}

#include #include<string.h> using namespace std; int a[100]; int main() { int i,maxn=-1000000,N,x=0; cin >> N; for(i = 0;i < N;i++) { cin >> a[i];

if(a[i]>maxn)maxn=a[i];
	x+=a[i];
}	
for(i=0;i<N;i++)
{
	if(a[i]==maxn)x-=maxn;
}
cout << x << endl;
return 0;

}

#include<iomanip>
#include<cmath>
#include<cstring>
using namespace std;
const int N=1e5+10;
const int INF=0x3f3f3f3f;
int n,a[N],m,maxx=-INF,y,ans;
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
		maxx=max(maxx,a[i]);
	}
	for(int i=1;i<=n;i++)
	{
		if(a[i]!=maxx)
		ans+=a[i];
	}
	cout<<ans;
    return 0;
}

#include<iostream>
#include<string.h>
using namespace std;
int a[100];
int main()
{
	int i,maxn=-1000000,N,x=0;
	cin >> N;
	for(i = 0;i < N;i++)
	{
		cin >> a[i];
	
		if(a[i]>maxn)maxn=a[i];
		x+=a[i];
	}	
	for(i=0;i<N;i++)
	{
		if(a[i]==maxn)x-=maxn;
	}
	cout << x << endl;
	return 0;
	
}

#include using namespace std; int a[2000000],n,k,d=1; int main(){

cin>>n;
for (int i=1;i<=n;i++){
	cin>>a[i]; 
}
for (int i;i<=n;i++)
	if(a[i] > d){
		d=a[i];
	}
cout<<d;
return 0;

}

#include<iostream>
#include<string.h>
using namespace std;
int a[100];
int main()
{
	int i,maxn=-1000000,N,x=0;
	cin >> N;
	for(i = 0;i < N;i++)
	{
		cin >> a[i];
	
		if(a[i]>maxn)maxn=a[i];
		x+=a[i];
	}	
	for(i=0;i<N;i++)
	{
		if(a[i]==maxn)x-=maxn;
	}
	cout << x << endl;
	return 0;
	
}

#include<iostream>
#include<string.h>
using namespace std;
int a[100];
int main()
{
	int i,maxn=-1000000,N,x=0;
	cin >> N;
	for(i = 0;i < N;i++)
	{
		cin >> a[i];
	
		if(a[i]>maxn)maxn=a[i];
		x+=a[i];
	}	
	for(i=0;i<N;i++)
	{
		if(a[i]==maxn)x-=maxn;
	}
	cout << x << endl;
	return 0;
	
}

jjjjjjjjjj

//dev c++[[990.cpp]]*******

//dev c++[top fanil]]******

//dev c++*www.temege.com

#include <stdio.h>

#include

#include <math.h>

#include

#include

#include

#include

#include <string.h>

#include

using namespace std;

#define LL long long

const int N=1e6+10;

const int INF=0x3f3f3f3f;

int a[110];

int main()

{

int n,maxx=-999999;

cin>>n;

for(int i=1;i<=n;i++)

{

	cin>>a[i];

	maxx=max(maxx,a[i]);

}

int sum=0;

for(int i=1;i<=n;i++)

{

	if(maxx!=a[i])

	{

		sum+=a[i];

	}

}

cout<<sum<<endl;

return 0;

}

#include<stdio.h> #include using namespace std; #define LL long long const int N=1e6+10; const int INF=0x3f3f3f3f; int a[N]; int main() { int n,sum=0; int maxx=-10000; cin>>n; for(int i=1;i<=n;i++) { cin>>a[i]; maxx=maxx>a[i]?maxx:a[i]; sum+=a[i]; } for(int i=1;i<=n;i++) if(a[i]==maxx) sum-=maxx; cout<<sum<<endl; }