TOP

UVA 10954- Add All(优先队列)

2015-07-20 17:20:55 来源: 作者: 【大中小】浏览:3次

Add All Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status

Description

Problem F
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

1 2 3

1 2 3 4

Problem setter: Md. Kamruzzaman, EPS

题意：有n个数的集合s，每次可以从s中删除两个数，然后把他们的和放回集合，直至剩下一个数。每次的开销等于删除的两个数的和，求最小总开销。

思路：使用从小到大排序的优先队列。

#include 
  
   
#include 
   
     #include 
    
      #include 
     
       #include 
      
        #include 
       
         #include 
        
          #include 
         
           #include 
           using namespace std; const int inf=0x3f3f3f3f; int main() { int n,i,a; int sum; while(~scanf("%d",&n)){ if(n==0) break; priority_queue
           
            ,greater
            
              > q; while(n--){ scanf("%d",&a); q.push(a); } sum=0; while(!q.empty()){ int x=q.top(); q.pop(); int y=q.top(); q.pop(); sum+=x+y; if(!q.empty()) q.push(x+y); } printf("%d\n",sum); } }


【大中小】【打印】【繁体】【投稿】【收藏】【推荐】【举报】【评论】【关闭】【返回顶部】
分享到:
上一篇：POJ 3009 Curling 2.0 （dfs）	下一篇：PAT03-1. 二分法求多项式单根(20)

帐　　号:

密码: (新用户注册)

验证码:

表　　情:

内　　容: