各位dalao，直接附上代码就OK，思路本蒟蒻还是不用滴

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int main() {
	unsigned long long n, m;
	cin >> n >> m;
	vector<unsigned long long> a(n);
	
	for (int i = 0; i < n; ++i) {
		cin >> a[i];
	}
	
	// 对得分数组进行排序
	sort(a.begin(), a.end());
	
	// 去掉最低分和最高分
	unsigned long long total_sum = 0;
	for (unsigned long long i = 1; i < n - 1; ++i) {
		total_sum += a[i];
	}
	
	// 输出去掉最高分和最低分后的和，乘以 (n-2)
	cout << total_sum << endl;
	
	return 0;
}