UVA Add All（优先队列）

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

3                                                                                                      1 2 3 4 1 2 3 4 0

9                                                                                                                                              19

#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<queue>

using namespace std;

struct cmp1
{
    bool operator()(long long int &a,long long int &b)

    {
        return a>b;
    }
};

int n;
long long int x;
long long int a[100010];

int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        if(n == 0)
        {
            break;
        }
        priority_queue<long long int,vector<long long int>,cmp1>q;
        while(!q.empty())
        {
            q.pop();
        }
        for(int i=0;i<n;i++)
        {
            scanf("%lld",&x);
            q.push(x);
        }
        long long int num1,num2;
        int k = 0;
        while(q.size()>1)
        {
            num1 = q.top();
            q.pop();
            num2 = q.top();
            q.pop();
            num1 = num1 + num2;
            a[k++] = num1;
            q.push(num1);
        }
        long long int cnt = 0;
        for(int i=0;i<k;i++)
        {
            cnt += a[i];
        }
        printf("%lld\n",cnt);
    }
    return 0;
}

#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<queue>

using namespace std;

struct cmp1
{
    bool operator()(long long int &a,long long int &b)

    {
        return a>b;
    }
};

int n;
long long int x;
long long int a[100010];

int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        if(n == 0)
        {
            break;
        }
        priority_queue<long long int,vector<long long int>,cmp1>q;
        while(!q.empty())
        {
            q.pop();
        }
        for(int i=0;i<n;i++)
        {
            scanf("%lld",&x);
            q.push(x);
        }
        long long int num1,num2;
        int k = 0;
        while(!q.empty())
        {
            num1 = q.top();
            q.pop();
            if(q.empty())
            {
                //a[k++] = num1;
                break;
            }
            num2 = q.top();
            q.pop();
            num1 = num1 + num2;
            a[k++] = num1;
            q.push(num1);
        }
        long long int cnt = 0;
        for(int i=0;i<k;i++)
        {
            cnt += a[i];
        }
        printf("%lld\n",cnt);
    }
    return 0;
}

#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<queue>

using namespace std;
/*
struct cmp1
{
    bool operator()(long long int &a,long long int &b)

    {
        return a>b;
    }
};*/

int n;
long long int x;
long long int a[100010];

int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        if(n == 0)
        {
            break;
        }
        priority_queue<long long int , vector<long long int>, greater<long long int> >q;
        //priority_queue<long long int,vector<long long int>,cmp1>q;
        while(!q.empty())
        {
            q.pop();
        }
        for(int i=0;i<n;i++)
        {
            scanf("%lld",&x);
            q.push(x);
        }
        long long int num1,num2;
        int k = 0;
        while(!q.empty())
        {
            num1 = q.top();
            q.pop();
            if(q.empty())
            {
                //a[k++] = num1;
                break;
            }
            num2 = q.top();
            q.pop();
            num1 = num1 + num2;
            a[k++] = num1;
            q.push(num1);
        }
        long long int cnt = 0;
        for(int i=0;i<k;i++)
        {
            cnt += a[i];
        }
        printf("%lld\n",cnt);
    }
    return 0;
}

---

Problem setter: Md. Kamruzzaman, EPS