Nate - life is tough,but I'm tougher

#include <cstdio>
#include <queue>
using namespace std;
int main()
{
    long long int N, x;
    while (scanf("%d", &N) && N)
    {
        priority_queue<int, vector<int>, greater<int>> PQ;
        for (int i = 0; i < N; ++i)
        {
            scanf("%d", &x);
            PQ.push(x);
        }
        long long int cost = 0;
        while (PQ.size() != 1)
        {
            x = PQ.top();
            PQ.pop();
            x += PQ.top();
            PQ.pop();
            cost += x;
            PQ.push(x);
        }
        printf("%lld\n", cost);
    }
    return 0;
}
#priority-queue