代码乱葬岗

#include <iostream> #include <queue> #include <vector> #define MAXNUM 10005 using namespace std; int a[MAXNUM]; int main(void) { //freopen("in.txt", "r", stdin); //freopen("out.txt", "w", stdout); int n, tmp, i, res = 0; scanf("%d", &n); for(i = 0; i < n; ++i) scanf("%d", &a[i]); //greater<Template>小的先出队 //less<Template>大的先出队 priority_queue<int, vector<int>, greater<int> > tree(a, a+n); while(tree.size() > 1) { tmp = tree.top(); tree.pop(); tmp += tree.top(); tree.pop(); res += tmp; tree.push(tmp); } printf("%d/n", res); return 0; }