[HDOJ5350]MZL's munhaff function

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

 

手写堆

 1 #include <algorithm>
 2 #include <iostream>
 3 #include <iomanip>
 4 #include <cstring>
 5 #include <climits>
 6 #include <complex>
 7 #include <fstream>
 8 #include <cassert>
 9 #include <cstdio>
10 #include <bitset>
11 #include <vector>
12 #include <deque>
13 #include <queue>
14 #include <stack>
15 #include <ctime>
16 #include <set>
17 #include <map>
18 #include <cmath>
19 
20 using namespace std;
21 
22 const int maxn = 100010;
23 const int INF = 2147483647;
24 int heap[maxn];
25 int pos;
26 
27 void init() {
28     pos = 0;
29     memset(heap, 0, sizeof(heap));
30     heap[0] = -INF;
31 }
32 
33 void push(int x) {
34     int i = ++pos;
35     for(; heap[i>>1] > x; i>>=1) {
36         heap[i] = heap[i>>1];
37     }
38     heap[i] = x;
39 }
40 
41 void pop() {
42     if(pos == 0) return;
43     int child = 1;
44     int i = 1;
45     int last = heap[pos--];
46     for(; i<<1 <= pos; i=child) {
47         child = i<<1;
48         if(child != pos && heap[child] > heap[child+1]) {
49             ++child;
50         }
51         if(last > heap[child]) {
52             heap[i] = heap[child];
53         }
54         else {
55             break;
56         }
57     }
58     heap[i] = last;
59 }
60 
61 int n;
62 
63 int main() {
64     int T_T;
65     init();
66     scanf("%d", &T_T);
67     while(T_T--) {
68         scanf("%d", &n);
69         pos = 0;
70         int tmp;
71         int nn = n;
72         while(nn--) {
73             scanf("%d", &tmp);
74             push(tmp);
75         }
76         long long ans = 0;
77         int a, b;
78         while(n-- > 1) {
79             a = heap[1], pop();
80             b = heap[1], pop();
81             tmp = a + b;
82             push(tmp);
83             ans += tmp;
84         }
85         printf("%I64d\n", ans);
86     }
87     return 0;
88 }

 

posted @ 2015-10-29 19:02  Kirai  阅读(183)  评论(0)  编辑  收藏  举报