[HDOJ5350]MZL's munhaff function

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5350

手写堆

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <climits>
#include <complex>
#include <fstream>
#include <cassert>
#include <cstdio>
#include <bitset>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <ctime>
#include <set>
#include <map>
#include <cmath>

using namespace std;

const int maxn = 100010;
const int INF = 2147483647;
int heap[maxn];
int pos;

void init() {
    pos = 0;
    memset(heap, 0, sizeof(heap));
    heap[0] = -INF;
}

void push(int x) {
    int i = ++pos;
    for(; heap[i>>1] > x; i>>=1) {
        heap[i] = heap[i>>1];
    }
    heap[i] = x;
}

void pop() {
    if(pos == 0) return;
    int child = 1;
    int i = 1;
    int last = heap[pos--];
    for(; i<<1 <= pos; i=child) {
        child = i<<1;
        if(child != pos && heap[child] > heap[child+1]) {
            ++child;
        }
        if(last > heap[child]) {
            heap[i] = heap[child];
        }
        else {
            break;
        }
    }
    heap[i] = last;
}

int n;

int main() {
    int T_T;
    init();
    scanf("%d", &T_T);
    while(T_T--) {
        scanf("%d", &n);
        pos = 0;
        int tmp;
        int nn = n;
        while(nn--) {
            scanf("%d", &tmp);
            push(tmp);
        }
        long long ans = 0;
        int a, b;
        while(n-- > 1) {
            a = heap[1], pop();
            b = heap[1], pop();
            tmp = a + b;
            push(tmp);
            ans += tmp;
        }
        printf("%I64d
", ans);
    }
    return 0;
}