sort使我快乐,好多冒泡都直接省了哈哈哈哈
#include <cmath>
#include <iomanip>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int n;
cin >> n;
int a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, g = 0;
int rem[100] = { 0 };
for (int i = 0; i < n; i++)
{
cin >> rem[i];
}
b = n - 1; c = n - 2;
for (int i = 1; i < n; i++)
{
sort(rem, rem + n,greater<int>());
e = rem[b] + rem[c];
d += e;
rem[b] = e;
b--; c--;
}
cout << d;
return 0;
}