【POJ3253】Fence Repair

problem

solution

codes

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

int l[20005];  

int main()  {  
    int n;
    while(cin>>n){  
        for(int i = 0;i < n; i++)cin>>l[i]; 
        priority_queue<int, vector<int>, greater<int> > q;  
        for(int i = 0; i < n; i++)q.push(l[i]);  
        long long ans = 0;
        while(q.size()>1){
            int a = q.top(); q.pop();  
            int b = q.top(); q.pop();  
            ans += (a+b);  
            q.push(a+b);  
        }  
        cout<<ans<<"\n";
    }  
    return 0;  
}

  

 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
  
15
  
16
  
17
  
18
  
19
  
20
  
21
  
22
  
23
  
24
  
25
 

文章来源: gwj1314.blog.csdn.net，作者：小哈里，版权归原作者所有，如需转载，请联系作者。

原文链接：gwj1314.blog.csdn.net/article/details/80461130