版权声明:假装有个原创声明……虽然少许博文不属于完全原创,但也是自己辛辛苦苦总结的,转载请注明出处,感谢! https://blog.csdn.net/m0_37454852/article/details/88429220
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
using namespace std;
const int MAX = 10010, INF = 1<<30;
void heapAdjust(int A[], int root, int len)
{
int left = root*2, right = left +1;
int largest = root;
if(left <= len && A[left] > A[largest]) largest = left;
if(right <= len && A[right] > A[largest]) largest = right;
if(largest != root)
{
swap(A[largest], A[root]);
heapAdjust(A, largest, len);
}
}
void heapSort(int A[], int len)
{
for(int i=len/2; i>0; i--) heapAdjust(A, i, len);
for(int i=len; i>0; i--)
{
swap(A[1], A[i]);
heapAdjust(A, 1, i-1);
}
}
int A[MAX] = {0};
int main()
{
int N;
scanf("%d", &N);
for(int i=1; i<=N; i++) scanf("%d", &A[i]);
heapSort(A, N);
for(int i=1; i<=N; i++) printf("%d\n", A[i]);
return 0;
}
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
using namespace std;
const int MAX = 10010, INF = 1<<30;
priority_queue<int, vector<int>, greater<int> > Q;
int main()
{
int N, X;
scanf("%d", &N);
for(int i=0; i<N; i++)
{
scanf("%d", &X);
Q.push(X);
}
while(!Q.empty())
{
printf("%d\n", Q.top());
Q.pop();
}
return 0;
}