uva 10954 Add All

Add All
Input: standard input
Output: standard output

Yup!! The problem name reflects 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, let’s add some flavor 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 3 + 3 = 6, cost = 6 Total = 9

1 + 3 = 4, cost = 4 2 + 4 = 6, cost = 6 Total = 10

2 + 3 = 5, cost = 5 1 + 5 = 6, cost = 6 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                           Output for Sample Input

3 1 2 3 4 1 2 3 4 0

9 19

大致题意：

    给你n个数，每两个数的和，再和第三个数相加，在所有的数都加了一遍后，最后把每次计算所得的和再全部加起来。

思路：

每次都是最小的两个数相加，最后再把结果都加起来一定最后的和是最小的。

这是我第一次用优先队列，原来用的思路太麻烦，看了大神用的优先队列，这一次也用STL偷了一下懒~

优先队列详解请点这里
 

#include <iostream>
#include <cstdio>
#include<cstring>
#include<queue>
#include <algorithm>
using namespace std;

struct cmp
{
    bool operator()(const int a, const int b)
    {
        return a>b;
    }
};

priority_queue<int,vector<int>,cmp>q;

int main()
{
   int n,i,j,k;
   int a[5050],b[5050];
  while(~scanf("%d",&n)&&n)
  {
     memset(b,0,sizeof(b));
     
     while(!q.empty()) q.pop();

      for(i=0;i<n;i++)
      {
           scanf("%d",&a[i]);
           q.push(a[i]);
      }
    int t=0; int sum=0;
    if(q.size()==1)
      {sum=q.top();}
    int tt=0;
   while(q.size()!=1)
   {   int tmp=0;
      tmp+=q.top();
       q.pop();
      tmp+=q.top();
       q.pop();
        b[tt++]=tmp;
        q.push(tmp);
   }

  for(i=0;i<tt;i++)
     sum+=b[i];
 cout<<sum<<endl;
  }
    return 0;
}