UVa 10954 Add All（贪心）

最新推荐文章于 2018-01-17 03:35:24 发布

神探特斯拉

最新推荐文章于 2018-01-17 03:35:24 发布

阅读量625

点赞数

分类专栏： stl 贪心

本文链接：https://blog.csdn.net/u013555159/article/details/51817165

版权

stl 同时被 2 个专栏收录

14 篇文章 0 订阅

订阅专栏

贪心

5 篇文章 0 订阅

订阅专栏

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, lets 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.

一.思路

稍微思考一下就会发现：首先我们不论怎样选择合并，我们合并的总次数是一定的，也就是说我们做的合并序列长度已定，那么我们先使用贪心来思考，只要我们每一次合并的cost最小那么我们和起来的序列总cost是否就是最小的？很显然当然不一定，因为我们当前的选择两个值的和回作为元素在此出现在序列里面，也就是说合并的贪心选择会影响后续的结果，但是我们进一步思考发现，贪心产生的元素也应该是最小的，这样这个贪心的策略应该就是可以的了。

//
//  main.cpp
//  UVa 10954
//
//  Created by 张嘉韬 on 16/7/3.
//  Copyright © 2016年 张嘉韬. All rights reserved.
//

#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>
using namespace std;
int n,sum;
int main(int argc, const char * argv[]) {
    while(cin>>n&&n!=0)
    {
        sum=0;
        priority_queue <int> q;
        for(int i=1;i<=n;i++)
        {
            int temp;
            cin>>temp;
            q.push(-temp);
        }
        while(!(q.size()==1))
        {
            int temp;
            temp=-q.top();
            //cout<<temp<<" ";
            q.pop();
            temp+=-q.top();
            //cout<<-q.top()<<" "<<endl;
            q.pop();
            sum+=temp;
            q.push(-temp);
        }
        cout<<sum<<endl;
        cout<<endl;
    }
    return 0;
}