POJ3253--Fence Repair

最新推荐文章于 2018-05-29 17:31:26 发布

youoasdfasdf

最新推荐文章于 2018-05-29 17:31:26 发布

阅读量191

点赞数

分类专栏： 2014暑期训练文章标签： poj algorithm stl

本文链接：https://blog.csdn.net/u011555702/article/details/38370313

版权

2014暑期训练专栏收录该内容

1 篇文章 0 订阅

订阅专栏

#include <iostream>

#include <algorithm>
#include <vector>
#include<queue>
using namespace std;
typedef long long ll;
class cmp
{
    public:
   bool operator()(ll a, ll b);
};
bool cmp::operator()(ll a , ll b)
{
    return a > b;
}
int main()
{
    int N;
    while(cin >> N)
    {
       priority_queue<ll , vector<ll>, cmp> pQueue;
       for(int i = 1; i <= N ;i++)
       {
           ll temp;
           cin >> temp;
           pQueue.push(temp);
       }
       ll minCost = 0;
       while(pQueue.size() >1 )
       {
           ll tmpA = pQueue.top();
           pQueue.pop();
           ll tmpB = pQueue.top();
           pQueue.pop();
           pQueue.push(tmpA + tmpB);
           minCost += tmpA + tmpB;
       }
       cout << minCost << endl;
        while(!pQueue.empty())
            pQueue.pop();

    }
    return 0;

STL 优先队列水过