题解 | 搬水果

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

using namespace std;

int main() 
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    while(cin >> n)
    {
        if(n == 0) break;
        vector<int> vec(n);
        for(int i = 0; i < n; i++) cin >> vec[i];
        int sum = 0;
        for(int i = 0; i < n - 1; i++)
        {
            sort(vec.begin(), vec.end());
            sum = sum + vec[i] + vec[i + 1];
            vec[i + 1] += vec[i];
            vec[i] = 0;
        }
        cout << sum << "\n";
    }
    return 0;
}