CodeVS 1063 合并果子

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int heap[20010] , temp ,size , ans , n , a , b;
void Insert(int x){
    int curr = ++size;
    heap[size] = x;
    int parent = curr / 2;
    while(parent > 0 && heap[parent] > heap[curr]){
        swap(heap[parent] , heap[curr]);
        curr = parent;
        parent = curr / 2;
    }     
}
void Pop(){
    heap[1] = heap[size--];
    int curr = 1;
    int son = curr * 2;
    if(heap[son] > heap[son + 1])son++;
    while(son <= size && heap[son] < heap[curr]){
        swap(heap[son] , heap[curr]);
        curr = son;
        son = curr * 2;
        if(heap[son] > heap[son + 1])son++;
    }
}

int main(){
    cin >> n;
    for(int i = 1 ; i <= n ; i++){
        cin >> temp;
        Insert(temp);
    }
    while(size > 1){
        a = heap[1];Pop();
        b = heap[1];Pop();
        temp = a + b;
        Insert(temp);
        ans += temp;
    }
    cout << ans << endl;
    return 0;
}