priority_queue优先队列完虐快排【doge】

#include<bits/stdc++.h>
using namespace std;
int n,x,ans;
priority_queue<int,vector<int>,greater<int> >q;
int main(){
	cin>>n;
	for(int i=0;i<n;i++)cin>>x,q.push(x);
	for(int i=0;i<n;i++)cout<<q.top()<<" ",q.pop();	
	return 0;
}