//堆排序 #include <iostream> using namespace std; int arr[100010]; int n,sz; void down(int u) { int t = u; if (u * 2 <= sz && arr[u * 2] < arr[t]) t = u * 2; if (u * 2 + 1 <= sz && arr[u * 2 + 1] < arr[t]) t = u * 2 + 1; if (u != t) { swap(arr[u], arr[t]); down(t); } } int main() { printf("你想输入多少个数字:"); scanf("%d", &n); sz = n; for (int i = 1; i <= n; i++) scanf("%d", &arr[i]); for (int i = n / 2; i; i--) down(i); while (sz) { printf("%d ", arr[1]); arr[1] = arr[sz--]; down(1); } return 0; }