#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int solve(vector<int>& arr, int k) {
    sort(arr.begin(), arr.end());
    int i = 0, j = arr.size() - 1;
    int moves = 0;
    while (i <= j) {
        if (arr[i] + arr[j] <= k) {
            i++;
            j--;
        } else {
            j--;
        }
        moves++; 
    }
    
    return moves;
}

class UserMainCode:
    @classmethod
    def minimumSum(cls, input1, input2):
        def array_sum(arr):
            return sum(arr)
        if len(input2) < 2:
            return array_sum(input2)
        initial_sum = array_sum(input2)
        sorted_arr = sorted(input2)
        largest = sorted_arr[-1]
        second_largest = sorted_arr[-2]
        avg = (largest + second_largest) / 2
        updated_arr = [0 if num < avg else num for num in input2]
        updated_sum = array_sum(updated_arr)
        return min(initial_sum, updated_sum)