#include <stdio.h>
int main()
{
    int n;
    long max = -1000001, cal = 0, num;
    scanf("%d", &n);
    for(int i = 0; i < n; i++)
    {
        scanf("%ld", &num);
        cal += num;
        if(num >= max)
            max = num;
    }
    cal -= max;
    printf("%ld", cal);
    return 0;
}

算法是先求和再减去最大数