https://www.luogu.com.cn #include<bits/stdc++.h> using namespace std; const int N=1e5+10; int h[N]; int size; void down(int u) { int t=u; if(u2<=size && h[t]>h[2u]) { t=u2; } if(u2+1<=size && h[t]>h[2u+1]) { t=u2+1; } if(t!=u) { swap(h[t],h[u]); down(t); } } void up(int u) { int t=u; if(h[u]<h[2u+1] && u/2!=0) { swap(h[u],h[2u+1]); up(u/2); } } int main() { int n; cin>>n; int sum=0,size=n; for(int i=1; i<=n; i++) cin>>h[i]; for(int i=n/2; i; i--) { down(i); } while(size!=1) { int = h[1]; sum += h[1]; swap(h[1],h[size]); size--; down(1); int v2 = h[1]; sum += h[1]; swap(h[1],h[size]); size--; down(1); size++; h[size] = v1+v2; up(size); } cout<<sum; return 0; }| col | col | col | | - | - | - | | content | content | content |