C++ :

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int a[1010],n,i,ma,mi,c = 0,s = 0;
	cin>>n;
	for(i = 0;i < n;i++){
		cin>>a[i];
		s = s + a[i];
	} 
	
	ma = a[0];
	mi = a[0];
	for(i = 1;i < n;i++){
		if(a[i] > ma){
			ma = a[i];
		}
		
		if(a[i] < mi){
			mi = a[i];
		}
	} 
	
	for(i = 0;i < n;i++){
		if(a[i] == mi){
			c++;
		}
	}
	
	cout<<ma + c * mi<<endl;
	cout<<s - (ma + c * mi)<<endl;
	return 0;
}

Java :

import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int num1 = scanner.nextInt();
//        int num2 = scanner.nextInt();
        int[] a = new int[num1];
        int s = 0,avg,x = 0;
        for (int i = 0; i < num1; i++) {
            a[i] = scanner.nextInt();
            x = x + a[i];
        }
        for (int i = 0; i < num1; i++) {
            if(MAX(a) == a[i]){
                    s = s + a[i];
                    a[i] = a[i] * 2;
            }else if(MIN(a) == a[i]) s = s + a[i];
        }
        System.out.println(s);
        System.out.println(x - s);

    }

    public static boolean judge(int i,int j){
        int a,s = 0;
        while(i != 0){
            a = i % 10;
            s = s + a;
            i /= 10;
        }
        if(s == j)return true;
        else return false;
    }

    public static void paiXu(int[] a){
        int temp;
        for(int i = 0;i < a.length - 1;i++){
            for(int k = 0;k < a.length - i - 1;k++){
                if(a[k] > a[k + 1]){
                    temp = a[k];
                    a[k] = a[k + 1];
                    a[k + 1] = temp;
                }
            }
        }
    }

    public static int MAX(int[] a){
        int max = a[0];
        for (int i = 0; i < a.length; i++) {
            if(max < a[i]){
                max = a[i];
            }
        }
        return max;
    }

    public static int MIN(int[] a){
        int min = a[0];
        for (int i = 0; i < a.length; i++) {
            if(min > a[i]){
               min = a[i];
            }
        }
        return min;
    }
}

Python :

# 接收输入整数n
n = int(input())
# n个数字放入字符串列表m中
m = input().split()
# 字符串列表转换为整型列表
su = 0
h = 0
for i in range(0, n):
    m[i] = int(m[i])
    su += m[i]
# 求列表中最大值mx
mx = max(m)
mi = min(m)
for i in range(0, n):
    if m[i] == mx:
        h += mx
        break
for i in range(0, n):
    if m[i] == mi:
        h += mi
print(h)
print(su - h)