题目1107：搬水果

import java.io.IOException;
import java.io.FileReader;
import java.io.BufferedReader;
import java.util.Scanner;
import java.util.PriorityQueue;

class Main
{
public static final boolean DEBUG = false;

public static void main(String[] args) throws IOException
{
Scanner cin;
int n;

if (DEBUG) {
cin = new Scanner(new BufferedReader(new FileReader("d:\\OJ\\uva_in.txt")));
} else {
cin = new Scanner(System.in);
}

while (cin.hasNext()) {
n = cin.nextInt();
if (n == 0) break;

PriorityQueue<Integer> q = new PriorityQueue<Integer>();

for (int i = 0; i < n; i++) {
q.add(new Integer(cin.nextInt()));
}

int sum = 0;
for (int i = 0; i < n - 1; i++) {
int a = q.poll().intValue();
int b= q.poll().intValue();

sum += a + b;

q.add(new Integer(a + b));
}

while (!q.isEmpty()) {
q.poll();
}

System.out.println(sum);
}
}
}