UVA_10954_AddAll

Add All

Yup!! The problem name re
ects your task; just add a set of numbers. But you may feel yourselves
condescended, to write a C/C++ program just to add a set of numbers. Such a problem will simply
question your erudition. So, lets add some
avor of ingenuity to it.
Addition operation requires cost now, and the cost is the summation of those two to be added. So,
to add 1 and 10, you need a cost of 11. If you want to add 1, 2 and 3. There are several ways
1 + 2 = 3, cost = 3 1 + 3 = 4, cost = 4 2 + 3 = 5, cost = 5
3 + 3 = 6, cost = 6 2 + 4 = 6, cost = 6 1 + 5 = 6, cost = 6
Total = 9 Total = 10 Total = 11
I hope you have understood already your mission, to add a set of integers so that the cost is minimal.
Input
Each test case will start with a positive number, N (2 N 5000) followed by N positive integers
(all are less than 100000). Input is terminated by a case where the value of N is zero. This case should
not be processed.
Output
For each case print the minimum total cost of addition in a single line.
Sample Input
3
1 2 3
4
1 2 3 4
0
Sample Output
9
19

水题

因为合并顺序任意，优先合并最小的权值会最低

因此和一次，排次序就好了

优先队列会更高效，但是不熟悉就没写优先队列的版本

效率是这个的一百倍……

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;

const int M=5005;
int num[M];

int main()
{
    int n;
    int tot;
    while(1)
    {
        scanf("%d",&n);
        if(!n)
            break;
        tot=0;
        for(int i=0;i<n;i++)
            scanf("%d",&num[i]);
        for(int i=0;i<n-1;i++)
        {
            sort(num+i,num+n);
            //cout<<num[i]<<" "<<num[i+1]<<endl;
            tot+=num[i]+num[i+1];
            num[i+1]+=num[i];
            num[i]=0;
        }
        printf("%d\n",tot);
    }
    return 0;
}