新聞| | PChome| 登入
2013-05-28 23:15:40| 人氣1,205| 回應0 | 上一篇 | 下一篇

[UVA][heap] 10954 - Add All

推薦 0 收藏 0 轉貼0 訂閱站台

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

 

Problem setter: Md. Kamruzzaman, EPS

每次挑兩個最小的出來加。


#include<stdio.h>
int Heap[5001], L;
void Swap(int x, int y) {
    static int tmp;
    tmp = Heap[x], Heap[x] = Heap[y], Heap[y] = tmp;
}
int siftUp(int site) {
    static int P, S;
    S = site, P = site>>1;
    while(S >= 2 && Heap[P] > Heap[S])
        Swap(P, S), S = P, P = S>>1;
}
int siftDown(int site) {
    static int P, S;
    P = site, S = site<<1;
    while(S <= L) {
        if(S < L && Heap[S+1] < Heap[S])
            S++;
        if(Heap[S] >= Heap[P])
            break;
        Swap(P, S), P = S, S = P<<1;
    }
}
void insHeap(int v) {
    ++L;
    Heap[L] = v;
    siftUp(L);
}
void delHeap() {
    Swap(1, L), L--;
    siftDown(1);
}
int main() {
    int N, i, v;
    while(scanf("%d", &N) == 1 && N) {
        L = 0;
        for(i = 0; i < N; i++) {
            scanf("%d", &v);
            insHeap(v);
        }
        int x, y, sum = 0;
        while(L >= 2) {
            x = Heap[1];
            delHeap();
            y = Heap[1];
            delHeap();
            sum += x+y;
            insHeap(x+y);
        }
        printf("%d\n", sum);
    }
    return 0;
}

我要檢舉
#10954#Add All#heap
台長： Morris

您可能對以下文章有興趣

人氣(1,205) | 回應(0)| 推薦 (0)| 收藏 (0)| 轉寄
全站分類: 不分類 | 個人分類: UVA |
此分類下一篇:[UVA][線段樹][區間最大連續和] 1400 - "Ray, Pass me the dishes!"
此分類上一篇:[UVa] 10019 - Funny Encryption Method

我要回應
否 是 (若未登入"個人新聞台帳號"則看不到回覆唷!)
* 請輸入識別碼：
請輸入圖片中算式的結果(可能為0) 
(有*為必填)
TOP
詳全文