代码求改，只过了第一个，用的优先队列

#include<iostream>
using namespace std;
#include<queue>
typedef long long ll;
int main() {
    priority_queue<ll, vector<ll>, greater<ll>>que;
    ll m;
    cin >> m;
    for (ll i = 0;i < m;i++) {
        ll data;
        cin >> data;
        que.push(data);
    }
    ll f = que.top();
    ll sum = 0;
    que.pop();
    while (!que.empty()) {
        ll a = que.top();
        que.pop();
        f += a;
        sum += f;
    }
    cout << sum;
    return 0;
}